DFA · Regular
Sipser’s M3: empty, or ends in 0
M2 with the accepting state swapped. Swapping accepting and rejecting states complements the language — and since the start state now accepts, the empty string is in it.
The author’s examples, run
ε → accept00110 → accept0 → accept0000000110 → accept1 → reject00111 → reject01 → reject0000000111 → reject