• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

GATE | GATE-CS-2009 | Question 15

Which one of the following is FALSE?


There is unique minimal DFA for every regular language


Every NFA can be converted to an equivalent PDA.


Complement of every context-free language is recursive.


Every nondeterministic PDA can be converted to an equivalent deterministic PDA.


Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments