DFA · Regular
Contains both aa and bb
Two searches at once: the state records the last letter and which of the two pairs has been seen. A product construction drawn out — and smaller than the full product, because seeing a pair also says what the last letter was.
The author’s examples, run
aabb → acceptaabba → acceptaaaabb → acceptaaaaaaabba → acceptbabb → rejectbabba → rejectaaaaab → rejectaaaaaaaaba → reject