Open In App
Related Articles

ISRO | ISRO CS 2017 – May | Question 12

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report

Which one of the following is FALSE?

(A)

There is a unique minimal DFA for every regular language

(B)

Every NFA can be converted to an equivalent PDA

(C)

Complement of every context-free language is recursive

(D)

Every non-deterministic PDA can be converted to an equivalent deterministic PDA



Answer: (D)

Explanation:

Refer: GATE-CS-2009 | Question 15



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

Last Updated : 20 Mar, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads