Skip to main content

Illustration DFA - words contain two or less 0s

DFA - words contain two or less 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\leq 2 \} $$

This is an infinite language with, for example, the following words \(w\):$$ L ~=~ \{\varepsilon, 0, 00, 001, 010, 110,~... \} $$

This automaton accepts all words \(w\) where the number \( |w|_0\) of zeros is two or less.