'Draw NFA for regular language

Here I found a example for a regular language.

L = { a^n | n>=2 } is regular. Clearly, we can draw a finite automaton with 3 states.

I was asking myself how this graph would look like. If I choose n=11, this means, that the language contains all words with a sequence of 11 a's. This can't be solved with a graph with 3 states, or am I wrong?

regular-languagefinite-automata


Sources

This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.

Source: Stack Overflow

Solution Source

Related Questions