×

Uniformly growing k-th power-free homomorphisms. (English) Zbl 0508.68051


MSC:

68Q45 Formal languages and automata
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Bean, D.R.; Ehrenfeucht, A.; McNulty, G., Avoidable patterns in strings of symbols, Pacific J. math., 85, 261-294, (1979) · Zbl 0428.05001
[2] Berstel, J., Sur LES mots sans carré définis par un morphisme, (), 16-29 · Zbl 0425.20046
[3] Déjean, F., Sur un théorème de thue, J. combinatorial theory, 13, 90-99, (1972) · Zbl 0245.20052
[4] Ehrenfeucht, A.; Rozenberg, G., On the subword complexity of square-free DOL languages, Theoret. comput. sci., 16, 339-342, (1981) · Zbl 0481.68073
[5] Harrison, M.A., Introduction to formal language theory, (1978), Addison-Wesley Reading, MA · Zbl 0411.68058
[6] Lyndon, R.; Schützenberger, M.P., The equations aM=bncp in a free group, Michigan math. J., 9, 289-298, (1962) · Zbl 0106.02204
[7] Ostrowski, A., Vorlesung über differential- und integralrechnung, () · Zbl 0058.28204
[8] Salomaa, A., Morphisms on free monoids and language theory, (), 141-166
[9] Thue, A., Über unendliche zeichernreihen, Norske vid. selsk. skr. I, mat.-nat. kl. christiana, 7, 1-22, (1906)
[10] Thue, A., Über die gegenseitige lage gleicher teile gewisser zeichenreihen, Norske vid. selsk. skr. I, mat.-nat. kl. christiana, 1, 1-67, (1912) · JFM 44.0462.01
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.