Which one of the following is FALSE?

ISRO Scientist/Engineer SC · May 2017 · Computer ScienceGATE · 2009 · CS

1. A.

   There is a unique minimal DFA for every regular language

2. B.

   Every NFA can be converted to an equivalent PDA

3. C.

   Complement of every context-free language is recursive

4. D.

   Every non-deterministic PDA can be converted to an equivalent deterministic PDA

Attempted by 322 students.