The scenario
Construct the ε-NFA for the regular expression (0|1)*101 using Thompson's construction, illustrating the standard systematic method for building NFAs from regex operators.
What is in this drawing
Read the decisions behind it.
01
Use separate epsilon transitions to enter and exit the Kleene star subexpression, plus a bypass for zero repetitions.
02
Model the union (0|1) with epsilon branches to the '0' and '1' alternatives that converge back.
03
Concatenate the star with the literal sequence 1-0-1 via an epsilon transition from the star's accept state to the start of the literal chain.
Useful when teaching or visualizing how Thompson's algorithm converts a regular expression into a nondeterministic finite automaton, especially for expressions with alternation, Kleene star, and concatenation.
More like this