NFA · Regular
Two a’s exactly three apart
Somewhere in the word, an a followed by any two symbols and then another a. The NFA waits, guesses the first a, and counts three; a DFA would have to remember the positions of the a’s among the last three symbols.
The author’s examples, run
aaaa → acceptaabba → acceptaaaaaa → acceptaaaaaaabba → acceptbaaa → rejectabbba → rejectε → rejectbaabb → reject