The GATE Grind

GATE 2009 CS – Question 16

Theory of Computation · Context-Free Grammars and Pushdown Automata · 1 mark · Multiple choice

Which one of the following is FALSE?

  1. There is a unique minimal DFA for every regular language.
  2. Every NFA can be converted to an equivalent PDA.
  3. Complement of every context-free language is recursive.
  4. Every nondeterministic PDA can be converted to an equivalent deterministic PDA.

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (D) Every nondeterministic PDA can be converted to an equivalent deterministic PDA.

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Context-Free Grammars and Pushdown Automata questions

All Context-Free Grammars and Pushdown Automata questions →