# Illustration DFA - word length divisible by 3

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 \{0,1\}^* ~:~ |w| ~\text{mod}~ 3 = 0 \}$$

This is a language with words $$w$$ whose word length $$|w|$$ is divisible by 3. For example:$$L ~=~ \{ \varepsilon, 0, 000, 111, 010, 101010,~... \}$$