Theory of Computation (Automata)
What is the name for the concept where a DFA and an NFA are considered equivalent because they recognize exactly the same class of languages?
- A. Recursively enumerable language
- B. Formal language
- C. Context-sensitive language
- D. DFA-NFA equivalence ✓
Correct answer
D. DFA-NFA equivalence
Explanation
DFA-NFA equivalence refers to the concept where a DFA and an NFA are considered equivalent because they recognize exactly the same class of languages.