Illustration DFA - strings of length 2

Get illustration

Share — copy and redistribute the material in any medium or format

Adapt — remix, transform, and build upon the material for any purpose, even commercially.

Sharing and adapting of the illustration is allowed with indication of the link to the illustration.

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 \}$$