In an automata or formal-language problem, which option best represents equivalence of NFA and DFA?

Correct Answer: C

NFAs and DFAs recognize exactly the class of regular languages

In this course context, equivalence of NFA and DFA means NFAs and DFAs recognize exactly the class of regular languages.