 |
HAL UPEC - UPEM Portal |  |
 |
Conference papers
Cyclic languages and strongly cyclic languages
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.
Cited literature [10 references]
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 : Wednesday, February 3, 2021 - 7:54:25 AM
Long-term archiving on: : Saturday, January 7, 2012 - 2:21:14 AM
Contributor : Marie-Pierre Béal <>
Submitted on : Thursday, October 6, 2011 - 2:03:44 PM
Last modification on : Wednesday, February 3, 2021 - 7:54:25 AM
Long-term archiving on: : Saturday, January 7, 2012 - 2:21:14 AM
Files
hal.pdf
Files produced by the author(s)