# 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

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~.... \}$$