Cyclic languages and strongly cyclic languages

Marie-Pierre Béal (1) , Olivier Carton (2) , Christophe Reutenauer (3)

1 LITP - Laboratoire Informatique Théorique et Programmation
2 LIGM - Laboratoire d'Informatique Gaspard-Monge
3 LaCIM - Laboratoire de combinatoire et d'informatique mathématique [Montréal]

We prove that cyclic languages are the boolean closure of languages called strongly cyclic languages. The result is used to give another proof of the rationality of the zeta function of rational cyclic languages.

Domaines: Algorithme et structure de données [cs.DS]

Marie-Pierre Béal, Olivier Carton, Christophe Reutenauer. Cyclic languages and strongly cyclic languages. International Symposium on Theoretical Aspects of Computer Science (STACS 96), 1996, Grenoble, France. pp.49-59. ⟨hal-00619852⟩