Q. 52 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 nondeterministic PDAcan be converted to an equivalent
deterministic PDA
Answer: (D)
Explanation:
