Which of the following statement is false?
(a) For non deterministic PDA, equivalence is undecidable
(b) For deterministic PDA, equivalence is decidable
(c) For deterministic PDA, equivalence is undecidable.
(d) None of the mentioned
The question was posed to me in an online interview.
This intriguing question comes from From PDA to Grammars in section Push Down Automata of Automata Theory