DFA · Regular
a, then later b, then later c
abc as a subsequence: the letters must appear in that order, but anything may come between them. A substring search falls back on a mismatch; a subsequence search never has to, since a wrong letter is just skipped. Four states, each a self-loop on everything it is not waiting for.
The author’s examples, run
abc → acceptbbaaccacbc → acceptaabc → acceptabbcaababcaccb → acceptbbc → rejectbbaaccacac → rejectaaac → rejectε → reject