DFA · Regular
Once bb, never aa
Two patterns in sequence: aa is allowed until the first bb, and forbidden from then on. The machine runs a search for bb, and when it finds it switches into a second machine that forbids aa — the order of events, remembered by which half of the diagram the run is in.
The author’s examples, run
ε → acceptaabba → accepta → acceptaaaaaaabba → acceptaabbaa → rejectaaaaaaabbaa → rejectbbaa → rejectabbaa → reject