ISRO | ISRO CS 2017 – May | Question 12
Which one of the following is FALSE?
There is a 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 non-deterministic PDA can be converted to an equivalent deterministic PDA
Refer: GATE-CS-2009 | Question 15
Quiz of this Question
Please comment below if you find anything wrong in the above post
My Personal Notes arrow_drop_up
Please Login to comment...