DFA · Regular
At least two 0s and at most one 1
Two thresholds checked together. Past two 0s the zero count no longer matters, and a second 1 is fatal, so the machine is a 3 × 2 product with no state for "two 1s".
The author’s examples, run
00 → accept010 → accept0000 → accept0000000010 → accept10 → reject110 → reject1000000010 → rejectε → reject