Converting an NFA to a DFA?
Posted on 2009-05-06
I'm trying to figure out how to convert an NFA to a DFA. (I assume people in this topic know what those are, if not let me know I will try to explain).
Making an NFA from a regular expression is ok, I just don't get the process by which you build a DFA from it. I think that you can visit each state of an NFA with every letter in your input alphabet, and tally up all the states you could be in - could someone let me know how to do this, step by step?