Get illustration
- download Pixel graphics (PNG)awesome for presentations
- download Vector graphics (SVG)awesome for websites
- Unlock everything
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{ is the binary representation of } n \in \mathbb{N} \text{ which is divisible by 2 (possibly with leading 0s)} \} $$
This is an infinite language, with, for example, the following words:$$ L ~=~ \{ \varepsilon, 0, 011, 0110011, ~... \} $$