Minimization of Deterministic Finite Automata (DFA)
Print this page
First
|
Last
|
Prev
|
Next
If
, then we are done, i.e.
is the minimum state DFA for
L
.
If
, then to prove the theorem we need to show that DFAs
and
M
are isomorphism.
First
|
Last
|
Prev
|
Next
, then we are done, i.e. 
is the minimum state DFA for L. 
, then to prove the theorem we need to show that DFAs and M are isomorphism.