# Illustration DFA - word contains at least one a

Sketch of a deterministic finite automaton (DFA) for the following regular language (type 3):$$L ~=~ \{ w \in \{ a,b \}^* ~:~ w \text{ contains at least one } a \}$$
This is an infinite language with, for example, the following words:$$L ~=~ \{ a, ab, ba, aba, bba, ~.... \}$$