Take the 2-minute tour ×  Can someone much brighter than I
succinctly describe to the SO community the NFA to DFA
conversion algorithm? (Preferably in 500 words or less.) I've
seen diagrams and lectures that have only served to confuse what
I thought I once knew. I'm mostly confident in generating an
initial NFA transition table from a state diagram, but after
that, I lose the DFA in the epsilons and subsets.  1) In a
transition (delta) table, which column represents the new DFA
states? Is it the first column of generated states?  2) In row
{2,3}, col 0 of my example below, what does the {2,3} mean about
the NFA in terms of its state diagram? (Sorry, I must think in
pictures.) And I assume it will be a "loop-back on input 0" in
the DFA?  3) Any simple "rules of thumb" on getting from the
table to the DFA or on recognizing the accept states of the
resulting DFA?  Finitely Autonomous  delta  |  0    |  1     |
{1}    |{1}    |{2}     | {2}    |{3}    |{2,3}   | {3}    |{2}
|{2,4}   | {2,3}  |{2,3}  |{2,3,4}