Open In App

GATE | GATE CS 2013 | Question 33

Like Article
Like
Save
Share
Report

Consider the DFA given. 

 

 Which of the following are FALSE?

(A)

Complement of L(A) is context-free.

(B)

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

(C)

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

(D)

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


Answer: (C) (D)

Explanation:

1 is true. L(A) is regular, its complement would also be regular. A regular language is also context free. 2 is true. 3 is false, the DFA can be minimized to two states. Where the second state is final state and we reach second state after a 0. 4 is clearly false as the DFA accepts a single 0. 


Quiz of this Question
Please comment below if you find anything wrong in the above post


Last Updated : 11 Oct, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads