# Illustration DFA - |w| greater than or equal to 3 and the 3rd symbol from the back is 0

Sketch of a deterministic finite automaton (DEA) for the following regular language (type 3):$$L ~=~ \{ w \in \{0,1\}^* ~:~ |w| \geq 3 \text{ and the 3rd letter from rhs is } 0 \}$$
This is an infinite language whose words are at least three characters long, and the 3rd symbol from right-hand side is a zero:$$L ~=~ \{ 000, 011, 1000, 0001, 101011, ~... \}$$