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 \{a,b\}^* ~:~ |w| \leq 2 \} $$
This is a finite language with words \(w\) whose word length \(|w|\) is less than or equal to 2:$$ L ~=~ \{\varepsilon, a, b, ab, ba, aa, bb \} $$