# Illustration DFA - word does not contain bb as a substring

Sketch of a deterministic finite automaton (DFA) for the following regular language (type 3):$$L ~=~ \{ w \in \{ a,b \}^* ~:~ w \text{ does not contain } bb \text{ as a partial word } \}$$
This is an infinite language with, for example, the following words:$$L ~=~ \{ \varepsilon, a, b, ab, aab, aba, aaabab~.... \}$$