Deterministic Finite Automata: Examples


a(bb)*bc

This automaton recognizes:

the language a(bb)*bc, i. e. the language formed by words that begin with an a followed by an odd number of b and a final c.