Beginner
Theory of Computation
Q4 / 100
What is the difference between a DFA and an NFA?
Correct! Well done.
Incorrect.
The correct answer is B) An NFA can have multiple transitions for the same input and ε-transitions; a DFA has exactly one transition per state-symbol pair
B
Correct Answer
An NFA can have multiple transitions for the same input and ε-transitions; a DFA has exactly one transition per state-symbol pair
Explanation
NFAs allow nondeterminism (multiple transitions, ε-moves). Every NFA can be converted to an equivalent DFA via the subset construction, though the DFA may have exponentially more states.
Progress
4/100