DFA · Regular
A keyword: if, in, int or for
A finite set of words is a trie, and a trie is a DFA. Minimising it merges every word’s ending into one state, since nothing can follow any of them — but in keeps its own, because int continues it.
The author’s examples, run
if → acceptin → acceptint → acceptfor → accepti → rejectfo → rejectinf → rejectinto → reject