Beginner
Theory of Computation
Q15 / 100
What is an ε-NFA?
Correct! Well done.
Incorrect.
The correct answer is B) An NFA that permits transitions on ε (empty string) without consuming input
B
Correct Answer
An NFA that permits transitions on ε (empty string) without consuming input
Explanation
ε-NFAs allow state changes on ε (no input consumed). Every ε-NFA can be converted to an equivalent DFA by computing ε-closures.
Progress
15/100