A hierarchy of cyclic languages
Carton, O.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997), p. 355-369 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1997-01-01
@article{ITA_1997__31_4_355_0,
     author = {Carton, O.},
     title = {A hierarchy of cyclic languages},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {31},
     year = {1997},
     pages = {355-369},
     mrnumber = {1605786},
     zbl = {0892.68056},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1997__31_4_355_0}
}

Carton, O. A hierarchy of cyclic languages. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) pp. 355-369. http://gdmltest.u-ga.fr/item/ITA_1997__31_4_355_0/

[BCR96] M.-P. Béal, O. Carton and C. Reutenauer, Cyclic languages and strongly cyclic languages. In STACS' 96, vol. 1046 of Lect. Notes in Comput. Sci., 1996, pp. 49-59. | MR 1462085

[Béa95] M.-P. Béal, Puissance extérieure d'un automate déterministe, application au calcul de la fonction zêta d'un système sofique. RAIRO-Informatique Théorique et Applications, 1995, 29 (2), pp. 85-103. | Numdam | MR 1329277 | Zbl 0843.58035

[BR90] J. Berstel and C. Reutenauer, Zeta functions of formal languages. Trans. Amer. Math. Soc., 1990, 321, pp. 533-546. | MR 998123 | Zbl 0797.68092

[Car93] O. Carton, Mots infinis, ω-semigroupes et topologie. Thèse, Université Paris 7. Rapport LITP-TH 93-08, 1993.

[Hau57] F. Hausdorff, Set Theory, Chelsea, New York, 1957. | MR 86020 | Zbl 0081.04601

[Lal79] G. Lallement, Semigroups and combinatorial applications, Wiley, 1979. | MR 530552 | Zbl 0421.20025

[Pin86] J.-E. Pin, Varieties of formal languages, North Oxford, London and Plenum, New York, 1986 (Traduction de Variétés de langages formels). | MR 912694 | Zbl 0632.68069