Intermediate
Theory of Computation
Q71 / 100
How do you systematically convert a regular expression into an NFA?
Correct! Well done.
Incorrect.
The correct answer is B) Using Thompson's construction, which builds small NFA fragments for each operator (union, concatenation, star) and combines them with ε-transitions
B
Correct Answer
Using Thompson's construction, which builds small NFA fragments for each operator (union, concatenation, star) and combines them with ε-transitions
Explanation
Thompson's construction recursively builds NFA fragments for each regex sub-expression and joins them with ε-transitions, guaranteeing the resulting NFA has at most twice as many states as regex symbols.
Progress
71/100