Library

ε-NFA · Regular

a’s, then b’s, then c’s

a*b*c* as three loops chained by ε-moves. The ε-closure of the start state is all three states, so the empty word, a lone b and a lone c are all accepted without the machine ever reading an a.

AsBsCsaεbεc
The machine as drawn — 3 states, 5 transitions.Every word up to length 5, one row per length in shortlex order, inked where it is accepted.

The author’s examples, run

ε → acceptabc → acceptaacc → acceptccccccc → acceptcbc → rejectbacc → rejectcaccccc → rejectba → reject