## Sets of primitive words given by fixed points of mappings.(English)Zbl 0992.68162

Summary: We present a solution of some equations on primitive words and in this sense our paper is a continuation of a research of T. Harju and M. Linna [$$(*)$$ RAIRO, Inf. Théor. Appl. 20, 47-54 (1986; Zbl 0608.68065)]. Our construction is less complicated and more general than in $$(*)$$. All the solutions are effective.

### MSC:

 68R15 Combinatorics on words

primitive words

Zbl 0608.68065
Full Text:

### References:

 [1] DOI: 10.1016/S0019-9958(78)90095-5 · Zbl 0387.68062 [2] Forys W., Boundary sets of words obtained by iterating mappings, This paper is submitted to the RAIRO [3] Harju T., Theoretical Informatics and Applications 20 pp 47– (1986) [4] Head, T. 1986.The Book of L, Fixed and stationaryw-words andw-languages, 147–155. Berlin: Springer Verlag. [5] Lothaire M., Encyclopedia of Mathematics 17 (1983) [6] Narbel P., Limits and Boundaries of Word and Tiling Substitutions,LITP TH93.12 (1993)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.