Question
In an automata or formal-language problem, which option best represents equivalence of NFA and DFA?
Select an option. Your answer will be checked instantly.
Correct Answer: C. NFAs and DFAs recognize exactly the class of regular languages
Explanation:
In this course context, equivalence of NFA and DFA means NFAs and DFAs recognize exactly the class of regular languages.
Leave a Reply