シナリオ
Construct an ε-NFA for the regular expression (a|b)*abb using Thompson construction, connecting union, star, and concatenation sub-automata with epsilon transitions.
この図に含まれるもの
図の背後にある意思決定を読み解く。
01
Use epsilon transitions to link union branches and allow star repetition
02
Model the star with skip and loop-back epsilon edges
03
Mark final state after matching 'abb' as accepting sink
Reusable for any regex-to-NFA conversion using Thompson construction, especially for teaching compiler design or automata theory.