If the final states and non-final states in the DFA below are interchanged,…

GATE · 2008 · IT

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?

1. A.

   Set of all strings that do not end with ab

2. B.

   Set of all strings that begin with either an a or a b

3. C.

   Set of all strings that do not contain the substring ab,

4. D.

   The set described by the regular expression b*aa*(ba)*b*

Attempted by 199 students.