Which one of the following is FALSE?
PYQ GATE 2009
Which one of the following is FALSE?
- A.
There is a unique minimal DFA for every regular language
- B.
Every NFA can be converted to an equivalent PDA
- C.
Complement of every context-free language is recursive
- D.
Every non-deterministic PDA can be converted to an equivalent deterministic PDA
Attempted by 415 students.
Sign up free to check your answer
Sign up freeLoading lesson…

