Question
What is meant by equivalence of NFA and DFA in Theory of Automata and Formal Languages?
Correct Answer: D
NFAs and DFAs recognize exactly the class of regular languages
The correct answer is NFAs and DFAs recognize exactly the class of regular languages.
The correct answer is NFAs and DFAs recognize exactly the class of regular languages.
Leave a Reply