Theory of Computation (Automata)
Which of the following best describes DFA-NFA equivalence?
- A. A finite-state machine whose output values are determined solely by its current state.
- B. A transition in a non-deterministic automaton that occurs without consuming any input symbol.
- C. The process of reducing a deterministic finite automaton to the smallest possible number of states while preserving its language.
- D. The concept where a DFA and an NFA are considered equivalent because they recognize exactly the same class of languages. ✓
Correct answer
D. The concept where a DFA and an NFA are considered equivalent because they recognize exactly the same class of languages.
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.