NFA · Regular
Some letter is missing
Over a, b and c, accept the words that do not use all three letters. The NFA guesses which letter will be missing and never reads it; a DFA has to track which letters it has seen — eight subsets instead of four states.
The author’s examples, run
ε → acceptaabba → acceptacca → acceptaabbbabbaaa → acceptcabba → rejectbcca → rejectcabbbabbaaa → rejectabc → reject