"the language of strings over the alphabet {0,1} in which there are at least n characters, the nth from last of which is 1. It can be represented by an (n + 1)-

"the language of strings over the alphabet {0,1} in which there are at least n characters, the nth from last of which is 1. It can be represented by an (n + 1)-state NFA, but it requires 2n DFA states, one for each n-character suffix of the input." http://en.wikipedia.org/wiki/Powerset_construction#Complexity http://en.wikipedia.org/wiki/Powerset_construction#Complexit...