# Illustration DFA - words end with 000

Sketch of a deterministic finite automaton (DEA) for the following regular language (type 3):$$L ~=~ \{ w \in \{0,1\}^* ~:~ w\text{ ends in } 000 \}$$
This is an infinite language with, for example, the following words $$w$$:$$L ~=~ \{ \varepsilon, 000, 1000, 111000, 0000, 001000,~.... \}$$