Example : Let us minimize the DFA given below
Figure 3
we execute the algorithm and mark a pair by putting an X on the table as shown in figure 4. ( Note that the table is a diagonal one having 
entries for a DFA having n states. )
| Minimization of Deterministic Finite Automata (DFA) | ||
Example : Let us minimize the DFA given below
we execute the algorithm and mark a pair by putting an X on the table as shown in figure 4. ( Note that the table is a diagonal one having |
||