Question
What is meant by equivalence of NFA and DFA in Theory of Automata and Formal Languages?
Select an option. Your answer will be checked instantly.
Correct Answer: D. NFAs and DFAs recognize exactly the class of regular languages
Explanation:
The correct answer is NFAs and DFAs recognize exactly the class of regular languages.
Leave a Reply