Question

Which one is a FALSE statement?

(a) There exists a unique DFA for every regular language

(b) NFA can always are converted to a PDA

(c) Complement of CFL is always recursive

(d) Every NDFA can be converted to a DFA

I got this question in quiz.

The doubt is from The NFA with epsilon topic in division Finite Automata and Regular Expression of Compiler

Answer 1

Right answer is (d) Every NDFA can be converted to a DFA

Easy explanation: Deterministic PDA cannot handle languages or grammars with ambiguity, but NDFA can handle with ambiguous languages as well as context-free grammar. Hence not every Ndfa can be converted to DFA.