engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Regular Languages and Finite Automata Finite Automata
Consider the following DFA:
What is the language accepted by the complement of the DFA?
1
{w | w begins with a}
2
{w | w does not begin with a}
3
{w | w contains a substring aa}
4
{w | w contains a substring bb}