DFA · Regular
Every a is followed by a b
Each a must be immediately answered by a b: the words of (b | ab)*. A request that is still waiting when the input ends is a rejection.
The author’s examples, run
ε → acceptbabb → acceptb → acceptababababbb → accepta → rejectaabb → rejectba → rejectaaabababbb → reject