If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet {a, b} will be accepted by the new DFA?
How to convert this FA to Reg-ex By state Elimination method
64.3k questions
77.9k answers
244k comments
80.0k users