# Illustration DFA - even number of 0s

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|_0 ~\text{mod}~ 2 = 0 \}$$

This is an infinite language with, for example, the following words $$w$$:$$L ~=~ \{\varepsilon, 1, 11, 00, 010, 110000,~... \}$$

This automaton accepts all words $$w$$ where the number $$|w|_0$$ of zeros is divisible by two (even number of 0s).