Skip to content
Related Articles

Related Articles

ISRO | ISRO CS 2017 – May | Question 12
  • Last Updated : 20 Mar, 2018

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) Compliment 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

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up
Recommended Articles
Page :