DFA · Regular
Sipser’s M4: starts and ends with the same symbol
The first symbol picks one of two separate halves of the machine, and each half then remembers only whether the last symbol matched the first. Nothing is ever shared between the halves. Compare “As many ab’s as ba’s”, which is the same language plus the empty string.
The author’s examples, run
a → acceptaabba → acceptaa → acceptaaaaaaabba → acceptε → rejectbabba → rejectba → rejectbaaaaaabba → reject