-
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 non-deterministic PDA can be converted to an equivalent deterministic PDA
- There is unique minimal DFA for every regular language
Correct Option: D
(a) true, since minimal DFA for every regular language is possible.
(b) true, NFA can be converted into an equivalent PDA.
(c) CG'S are not recursive but their complements are.
(d) false, since non deterministic PDA represents, non deterministic. CFG, since NDCFG and CFG are proper subsets so conversion required.
