Deterministic Finite Automata: Examples
Even number of b's
This automaton recognizes:
the set of all strings over the alphabet
{a,b}
that have an even number of
b
's.
This automaton recognizes: