Minimal DFA
Minimal DFA. Among the many DFAs accepting the same regular language L, there is exactly one (up to renaming of states) which has the smallest possible number of states. Moreover, it is possible to obtain that minimal DFA for L starting from any other by the State Minimization Algorithm .
625 views • 28 slides