• For every FA M, there is an equivalent DFA Md.
Proof is based on these conversions:
Finite Automaton M
e-free Finite Automaton M’
DFA  Md
L(M) = L(M’)
L(M’) = L(Md)
Theorem
6/44