It is easy to show (by induction ) that the pair ( p, q ) is mraked by the above algorithm iff 
s.t. 
and 
(or vice versa ) i.e. if 
.
s.t. and (or vice versa ) i.e. if .| Minimization of Deterministic Finite Automata (DFA) | ||
It is easy to show (by induction ) that the pair ( p, q ) is mraked by the above algorithm iff s.t. and (or vice versa ) i.e. if . |
||