Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
Consider the DFA A given below
Which of the following are FALSE?
1. Complement of L(A) is context-free.
2. L(A) = L((11*0 + 0)(0 + 1)*0*1*)
3. For the language accepted by A, A is the minimal DFA.
4. A accepts all strings over {0, 1} of length at least 2.
1
1 and 3 only
2
2 and 4 only
3
2 and 3 only
4
3 and 4 only