On the periodicity of morphisms on free monoids
Harju, Tero ; Linna, Matti
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 20 (1986), p. 47-54 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU) 
@article{ITA_1986__20_1_47_0,
     author = {Harju, Tero and Linna, Matti},
     title = {On the periodicity of morphisms on free monoids},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {20},
     year = {1986},
     pages = {47-54},
     mrnumber = {849965},
     zbl = {0608.68065},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1986__20_1_47_0}
}

Harju, Tero; Linna, Matti. On the periodicity of morphisms on free monoids. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 20 (1986) pp. 47-54. http://gdmltest.u-ga.fr/item/ITA_1986__20_1_47_0/

1. K. Culik Ii, The Ultimate Equivalence Problem for DOL Systems, Acta Informatica, Vol. 10, 1978, pp. 79-84. | MR 495230 | Zbl 0385.68060

2. A. Ehrenfeucht and G. Rozenberg, On Simplifications of PDOL Systems, Proceedings of a Conference on Theoretical Computer Science, University of Waterloo, Waterloo, Ontario, Canada, 1977. | MR 495235 | Zbl 0414.68046

3. T. Harju and M. Linna, The equations h(w) = wn in binary alphabets, Theoret. Comput. Sci. 33, 1984, pp. 327-329. | MR 767397 | Zbl 0548.20044

4. T. Head, Adherence Equivalence is Decidable for DOL Languages, Proceedings of a Symposium of Theoretical Aspects of Computer Science, Paris, 1984, Springer Lecture Notes in Computer Science, Vol. 166, 1984, pp. 241-248. | MR 773326 | Zbl 0543.68060

5. M. Linna, The Decidability of the DOL Prefix Problem, Int. J. Comput. Math., Vol. 6, 1977, pp. 127-142. | MR 471462 | Zbl 0358.68114

6. M. Linna, On Periodic ω-Sequences Obtained by Iterating Morphisms, Ann. Univ. Turkuensis, Ser. A I 186 1984, pp. 64-71. | MR 748519 | Zbl 0547.68074

7. A. Salomaa, Comparative Decision Problems between Sequential and Parallel Rewriting, Proc. Symp. Uniformly Structured Automata and Logic, Tokyo, 1975, pp. 62-66. | MR 489059