NFA · Regular
The third symbol from the end is a 1, by guessing
Four states: wait, then guess that this 1 is the third from the end and check that exactly two symbols follow. The DFA for the same language needs eight — the guess replaces remembering the last three symbols.
The author’s examples, run
100 → accept0110 → accept00100 → accept0000000110 → accept000 → reject0010 → reject00000 → reject0000000010 → reject