On the periodicity of morphisms on free monoids

Tero Harju; Matti Linna

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1986)

  • Volume: 20, Issue: 1, page 47-54
  • ISSN: 0988-3754

How to cite

top

Harju, Tero, and Linna, Matti. "On the periodicity of morphisms on free monoids." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 20.1 (1986): 47-54. <http://eudml.org/doc/92245>.

@article{Harju1986,
author = {Harju, Tero, Linna, Matti},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {D0L systems; periodic -words; primitive words; finitely generated free monoid; D0L periodicity problem},
language = {eng},
number = {1},
pages = {47-54},
publisher = {EDP-Sciences},
title = {On the periodicity of morphisms on free monoids},
url = {http://eudml.org/doc/92245},
volume = {20},
year = {1986},
}

TY - JOUR
AU - Harju, Tero
AU - Linna, Matti
TI - On the periodicity of morphisms on free monoids
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1986
PB - EDP-Sciences
VL - 20
IS - 1
SP - 47
EP - 54
LA - eng
KW - D0L systems; periodic -words; primitive words; finitely generated free monoid; D0L periodicity problem
UR - http://eudml.org/doc/92245
ER -

References

top
  1. 1. K. CULIK II, The Ultimate Equivalence Problem for DOL Systems, Acta Informatica, Vol. 10, 1978, pp. 79-84. Zbl0385.68060MR495230
  2. 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. Zbl0414.68046MR495235
  3. 3. T. HARJU and M. LINNA, The equations h(w) = wn in binary alphabets, Theoret. Comput. Sci. 33, 1984, pp. 327-329. Zbl0548.20044MR767397
  4. 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. Zbl0543.68060MR773326
  5. 5. M. LINNA, The Decidability of the DOL Prefix Problem, Int. J. Comput. Math., Vol. 6, 1977, pp. 127-142. Zbl0358.68114MR471462
  6. 6. M. LINNA, On Periodic ω-Sequences Obtained by Iterating Morphisms, Ann. Univ. Turkuensis, Ser. A I 186 1984, pp. 64-71. Zbl0547.68074MR748519
  7. 7. A. SALOMAA, Comparative Decision Problems between Sequential and Parallel Rewriting, Proc. Symp. Uniformly Structured Automata and Logic, Tokyo, 1975, pp. 62-66. MR489059

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.