ISRO | ISRO CS 2017 – May | Question 12
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
Explanation: Refer: GATE-CS-2009 | Question 15
Quiz of this Question