×

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


MSC:

68Q45 Formal languages and automata
PDFBibTeX XMLCite
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, (Proc. 6th International Colloquium Automata, Languages, and Programming. Proc. 6th International Colloquium Automata, Languages, and Programming, Lecture Notes in Computer Science, 71 (1979), Springer: Springer Berlin), 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: Addison-Wesley Reading, MA · Zbl 0411.68058
[6] Lyndon, R.; Schützenberger, M. P., The equations \(a^M=b^{N\) · Zbl 0106.02204
[7] Ostrowski, A., Vorlesung über Differential- und Integralrechnung, (Erster Band (1960), Birkhäuser Verlag: Birkhäuser Verlag Stuttgart) · Zbl 0058.28204
[8] Salomaa, A., Morphisms on free monoids and language theory, (Book, R. V., Formal Language Theory: Perspectives and Open Problems (1980), Academic Press: Academic Press New York), 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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.