Question
Which statement correctly describes equivalence of NFA and DFA?
Correct Answer: A
NFAs and DFAs recognize exactly the class of regular languages
equivalence of NFA and DFA is correctly described as NFAs and DFAs recognize exactly the class of regular languages.
equivalence of NFA and DFA is correctly described as NFAs and DFAs recognize exactly the class of regular languages.
Leave a Reply