Library

DFA · Regular

Never contains 110

Once 11 has been read, a 0 would complete the forbidden pattern and every further 1 keeps the danger alive — so the state after 11 has a self-loop on 1 and no way out on 0.

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

The author’s examples, run

ε → accept10011 → accept0 → accept0000001011 → accept11011 → reject0000011011 → reject110 → reject00110 → reject