Minimization of DFA is required to obtain the minimal and equivalent version of any DFA which consists of the minimum number of states possible. Use Myhill-Nerode theorem to convert the following state transition function table of DFA to its equivalent DFA with a minimum no of states.

Minimization of DFA is required to obtain the minimal and equivalent version of any DFA which consists of the minimum number of states possible. Use Myhill-Nerode theorem to convert the following state transition function table of DFA to its equivalent DFA with a minimum no of states. Present State Next State Input a Input b 90 Final state 21 Final state 92 93 94 Final state 95 91 93 94 94 95 92 24 92 95 94 95 95