# Illustration DFA - Words do not end with 000

Sketch of a deterministic finite automaton (DFA) for the following regular language (type 3):$$L ~=~ \{ w \in \{0,1\}^* ~:~ w\text{ does not end in } 000 \}$$
This is an infinite language with, for example, the following words $$w$$:$$L ~=~ \{ \varepsilon, 0, 1, 111, 00, 001,~... \}$$