By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
431,745 Members | 1,897 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 431,745 IT Pros & Developers. It's quick & easy.

program for conversion of ndfa to dfa in automata

P: 1
it is very necessary for me .ihv
Sep 21 '06 #1
Share this Question
Share on Google+
1 Reply

Expert 10K+
P: 11,448
it is very necessary for me .ihv
Read the 'Dragon Book'; the construction is extremely simple, i.e.
for every state transition S->a->E1, S->a->E2 ... S->a->En, build a state
{ E1, E2 ... En } and take all outgoing edges on that new state and add a new
state again until no more new states can be added. Note that this procedure
does not produce a minimal DFA.

kind regards,

Oct 5 '07 #2

Post your reply

Sign in to post your reply or Sign up for a free account.