| Minimization of Deterministic Finite Automata (DFA) | ||
Initially, all cells are unmarked. (i.e. at step 1 of the algorithm) . After step 2, all cells representing pairs of states of which one is accepting and the other is non-accepting are marked by putting an X. The table above shows the status after this step. |
||