# Illustration DFA - strings of length 2

Sketch of a deterministic finite automaton (DFA) for the following regular language (type 3):$$L ~=~ \{ w \in \{a,b\}^* ~:~ |w| = 2 \}$$
This is a finite language with words $$w$$ whose word length $$|w|$$ is exactly 2. So the language consists of only four words:$$L ~=~ \{ aa, ab, ba, bb \}$$