Library

DFA · Regular

Never contains aba

The complement of a search: the same states as a matcher for aba, with the final one removed. Every state that remains accepts.

noneaabbaabb
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

ε → acceptaabba → accepta → acceptaaaaaaabba → acceptaaaba → rejectabaaaaabba → rejectaba → rejectaababb → reject