Generalized de Bruijn words and the state complexity of conjugate sets
We consider a certain natural generalization of de Bruijn words, and use it to compute the exact maximum state complexity for the language consisting of the conjugates of a single word.
READ FULL TEXT