|NFA to DFA question firstname.lastname@example.org (Unmesh joshi) (2003-01-12)|
|Re: NFA to DFA question email@example.com (Clint Olsen) (2003-01-17)|
|Re: NFA to DFA question firstname.lastname@example.org (2003-01-17)|
|Re: NFA to DFA question email@example.com (Michael N. Christoff) (2003-01-17)|
|Re: NFA to DFA question firstname.lastname@example.org (2003-01-21)|
|Re: NFA to DFA question email@example.com (Joachim Durchholz) (2003-01-25)|
|Re: NFA to DFA question firstname.lastname@example.org (Ralph Becket) (2003-01-30)|
|From:||"Unmesh joshi" <email@example.com>|
|Date:||12 Jan 2003 17:42:25 -0500|
|Posted-Date:||12 Jan 2003 17:42:25 EST|
I am reading the compilers book by Aho ullman, and I have one doubt about
NFA to DFA conversion.
"Every state of DFA corresponds to 'set of states' in NFA". Can anybody
explain to me this? Does anybody has a source code sample for NFA-DFA? May
be if I implement the DFA algorithm I will understand what that means.
Thanks a lot,
Return to the
Search the comp.compilers archives again.