Draw a DFA that recognizes the language a .*a|b .*b and then draw an NFA with fewer states that recognizes the same language.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.