Deterministic Finite Automata: Examples


At Most Two Consecutive b

This automaton recognizes:

any sequence on the alphabet I={a,b} containing at most two consecutive b's.