GATE | GATE-CS-2009 | Question 15

Which one of the following is FALSE?

(A) There is 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 nondeterministic PDA can be converted to an equivalent deterministic PDA.


Answer: (D)

Explanation: Power of Deterministic PDA is not same as the power of Non-deterministic PDA. Deterministic PDA cannot handle languages or grammars with ambiguity, but NDPDA can handle languages with ambiguity and any context-free grammar. So every non-deterministic PDA can not be converted to an equivalent deterministic PDA.

Quiz of this Question



My Personal Notes arrow_drop_up

Recommended Posts:



0 Average Difficulty : 0/5.0
No votes yet.






User Actions