# Illustration DFA - words contain two or less 0s

Sketch of a deterministic finite automaton (DFA) for the following regular language (type 3):$$L ~=~ \{ w \in \{0,1\}^* ~:~ |w|_0\leq 2 \}$$
This is an infinite language with, for example, the following words $$w$$:$$L ~=~ \{\varepsilon, 0, 00, 001, 010, 110,~... \}$$
This automaton accepts all words $$w$$ where the number $$|w|_0$$ of zeros is two or less.