Abstract : 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.
https://hal-upec-upem.archives-ouvertes.fr/hal-00619852
Contributor : Marie-Pierre Béal
<>
Submitted on : Thursday, October 6, 2011 - 2:03:44 PM
Last modification on : Friday, January 4, 2019 - 5:33:25 PM
Long-term archiving on: Saturday, January 7, 2012 - 2:21:14 AM
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⟩
