468,512 Members | 1,046 Online
Bytes | Developer Community
New Post

Home Posts Topics Members FAQ

Post your question to a community of 468,512 developers. It's quick & easy.

program for conversion of ndfa to dfa in automata

it is very necessary for me .ihv
Sep 21 '06 #1
1 5135
JosAH
11,448 Expert 8TB
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,

Jos
Oct 5 '07 #2

Post your reply

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

Similar topics

reply views Thread by XMLGuy | last post: by
23 posts views Thread by Ricky | last post: by
1 post views Thread by Willing 2 Learn | last post: by
7 posts views Thread by defcon8 | last post: by
4 posts views Thread by onkar | last post: by
17 posts views Thread by JunDa.Huang | last post: by
2 posts views Thread by conics | last post: by
reply views Thread by NPC403 | last post: by
1 post views Thread by fmendoza | last post: by
By using this site, you agree to our Privacy Policy and Terms of Use.