it is very necessary for me .ihv
-
-
Read the 'Dragon Book'; the construction is extremely simple, i.e.Originally posted by milind singh
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
Comment