Asymptotic behaviour of bi-infinite words

 Access to full text

 Full (PDF)

1. [1] A. Ehrenfeucht and G. Rozenberg, Simplifications of homomorphism. Inform. Control 38 (1978) 298–309. Zbl0387.68062
2. [2] W. Foryś and T. Head, The poset of retracts of a free monoid. Int. J. Comput. Math. 37 (1990) 45–48. Zbl0723.68060
3. [3] T. Harju and M. Linna, On the periodicity of morphism on free monoid. RAIRO: Theoret. Informatics Appl. 20 (1986) 47–54. Zbl0608.68065
4. [4] T. Head, Expanded subalphabets in the theories of languages and semigroups. Int. J. Comput. Math. 12 (1982) 113–123. Zbl0496.68050
5. [5] T. Head and V. Lando, Fixed and stationary $\omega$-wors and $\omega$-languages. The book of L, Springer-Verlag, Berlin (1986) 147–155. Zbl0586.68063
6. [6] M. Lothaire, Combinatorics on words. Addison-Wesley (1983). Zbl0514.20045MR675953
7. [7] J. Matyja, Sets of primitive words given by fixed points of mappings. Int. J. Comput. Math. (to appear). Zbl0992.68162MR1833764
8. [8] P. Narbel, Limits and boundaries of words and tiling substitutions. LITP, TH93.12 (1993). 
9. [9] P. Narbel, The boundary of iterated morphisms on free semi-groups. Int. J. Algebra Comput. 6 (1996) 229–260. Zbl0852.68074
10. [10] J. Shallit and M. Wang, On two-sided infinite fixed points of morphisms. Lect. Notes Comput. Sci. 1684 (1999) 488–499. Zbl0945.68115