Skip to main content

Illustration DFA - Words do not end with 000

<span>DFA - Words do not end with 000</span>
DFA - Words do not end with 000

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{ does not end in } 000 \} $$

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