We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)
References
[1]
Ehrenfeucht, A. and Rozenberg, G., Simplifications of homomorphism. Inform. Control38 (1978) 298–309.
CrossRef
[2]
Foryś, W. and Head, T., The poset of retracts of a free monoid. Int. J. Comput. Math.37 (1990) 45–48.
CrossRef
[3]
Harju, T. and Linna, M., On the periodicity of morphism on free monoid. RAIRO: Theoret. Informatics Appl.20 (1986) 47–54.
[4]
Head, T., Expanded subalphabets in the theories of languages and semigroups. Int. J. Comput. Math.12 (1982) 113–123.
CrossRef
[5]
T. Head and V. Lando, Fixed and stationary ω-wors and ω-languages. The book of L, Springer-Verlag, Berlin (1986) 147–155.
[6]
M. Lothaire, Combinatorics on words. Addison-Wesley (1983).
[7]
J. Matyja, Sets of primitive words given by fixed points of mappings. Int. J. Comput. Math. (to appear).
[8]
P. Narbel, Limits and boundaries of words and tiling substitutions. LITP, TH93.12 (1993).
[9]
Narbel, P., The boundary of iterated morphisms on free semi-groups. Int. J. Algebra Comput.6 (1996) 229–260.
CrossRef
[10]
Shallit, J. and Wang, M., On two-sided infinite fixed points of morphisms. Lect. Notes Comput. Sci.1684 (1999) 488–499.
CrossRef