Skip to main content

Illustration DFA - word does not contain bb as a substring

DFA - word does not contain bb as a substring
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 \text{ does not contain } bb \text{ as a partial word } \} $$

This is an infinite language with, for example, the following words:$$ L ~=~ \{ \varepsilon, a, b, ab, aab, aba, aaabab~.... \} $$