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 nondeterministic PDA can be converted to an equivalent deterministic PDA.
There is a unique minimal DFA for every regular language T
Every NFA can be converted to an equivalent PDA. T
Complement of every context-free language is recursive. T
Every nondeterministic PDA can be converted to an equivalent deterministic PDA. F
Gatecse