DFA · Regular
An a in every odd position
Positions 1, 3, 5, … must hold a; the others may hold anything. The machine only needs to know whether the next position is odd or even.
The author’s examples, run
ε → acceptabaa → accepta → acceptaaaaaaabaa → acceptb → rejectbbaa → rejectba → rejectbaaaaaabaa → reject