Question
Which statement correctly describes equivalence of NFA and DFA?
Select an option. Your answer will be checked instantly.
Correct Answer: A. NFAs and DFAs recognize exactly the class of regular languages
Explanation:
equivalence of NFA and DFA is correctly described as NFAs and DFAs recognize exactly the class of regular languages.
Leave a Reply