Library

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.

q1q20110
The machine as drawn — 2 states, 4 transitions.Every word up to length 8, one row per length in shortlex order, inked where it is accepted.

The author’s examples, run

ε → accept00110 → accept0 → accept0000000110 → accept1 → reject00111 → reject01 → reject0000000111 → reject