No CrossRef data available.
Article contents
Asymptotic behaviour of bi-infinite words
Published online by Cambridge University Press: 15 March 2004
Abstract
We present a description of asymptotic behaviour of languages of bi-infinite words obtained by iterating morphisms defined on free monoids.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2004
References
Ehrenfeucht, A. and Rozenberg, G., Simplifications of homomorphism.
Inform. Control
38 (1978) 298–309.
CrossRef
Foryś, W. and Head, T., The poset of retracts of a free monoid.
Int. J. Comput. Math.
37 (1990) 45–48.
CrossRef
Harju, T. and Linna, M., On the periodicity of morphism on free monoid.
RAIRO: Theoret. Informatics Appl.
20 (1986) 47–54.
Head, T., Expanded subalphabets in the theories of languages and semigroups.
Int. J. Comput. Math.
12 (1982) 113–123.
CrossRef
T. Head and V. Lando, Fixed and stationary ω-wors and ω-languages. The book of L, Springer-Verlag, Berlin (1986) 147–155.
M. Lothaire, Combinatorics on words. Addison-Wesley (1983).
J. Matyja, Sets of primitive words given by fixed points of mappings. Int. J. Comput. Math. (to appear).
P. Narbel, Limits and boundaries of words and tiling substitutions. LITP, TH93.12 (1993).
Narbel, P., The boundary of iterated morphisms on free semi-groups.
Int. J. Algebra Comput.
6 (1996) 229–260.
CrossRef
Shallit, J. and Wang, M., On two-sided infinite fixed points of morphisms.
Lect. Notes Comput. Sci.
1684 (1999) 488–499.
CrossRef