Generalized de Bruijn Words and the State Complexity of Conjugate Sets
Résumé
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. In other words, we determine the state complexity of cyclic shift on languages consisting of a single word.
Domaines
Informatique [cs]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...
