Skip to main content

Illustration DFA - a^n b^m - If n is greater than or equal to 2, then m is also greater than or equal to 2

<span>DFA - a^n b^m - If n is greater than or equal to 2, then m is also greater than or equal to 2</span>
DFA - If n is greater than or equal to 2, then m is also greater than or equal to 2
Download

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 ~=~ \{ a^n \, b^m ~:~ \text{ if } n\geq 2 \text{ so is } m\geq2 \} $$

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