GATE | CS | 2013 | TOC | Finite Automata | Question 33

Last Updated :
Discuss
Comments

Consider the DFA given. 

 

 Which of the following are FALSE?

Complement of L(A) is context-free.

L(A) = L((11*0+0)(0 + 1)*0*1*).

For the language accepted by A, A is the minimal DFA.

A accepts all strings over {0, 1} of length at least 2.

This question is part of this quiz :

GATE CS 2013,Regular languages and finite automata,Finite Automata PYQ QUIZ GATE CS
Tags:
GATE
Theory of Computation
Share your thoughts in the comments