×

On cube-free \(\omega\)-words generated by binary morphisms. (English) Zbl 0505.03022


MSC:

03D40 Word problems, etc. in computability and recursion theory
20M05 Free semigroups, generators and relations, word problems
08A50 Word problems (aspects of algebraic structures)
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 une morphisme, Springer lecture notes in computer science, 71, 16-25, (1979) · Zbl 0425.20046
[3] Berstel, J., Mots sans carré et morphismes iteres, Discrete math., 29, 235-244, (1979) · Zbl 0444.20050
[4] Brandenburg, F.-J., Uniformily growing k-free homomorphisms, Theoret. comput. sci., 23, (1983), to appear
[5] Dejean, F., Sur un théorème de thue, J. combin. theory, 13, 90-99, (1972) · Zbl 0245.20052
[6] Ehrenfeucht, A.; Rozenberg, G., On the subword complexity of square-free DOL languages, Theoret. comput. sci., 16, 25-32, (1981) · Zbl 0481.68073
[7] Karhumäki, J., On strongly cube-free ω-words generated by binary morphisms, Springer lecture notes in computer science, 117, 182-189, (1981) · Zbl 0462.68055
[8] Rozenberg, G.; Salomaa, A., The mathematical theory of L systems, (1980), Academic Press London · Zbl 0365.68072
[9] Salomaa, A., Jewels of formal language theory, (1981), Computer Science Press · Zbl 0487.68063
[10] Thue, A., Über unendliche zeichenreihen, videnskapsselskapets skrifter. I., Mat.-naturv. klasse, 1-22, (1906), Kristiania
[11] Thue, A., Über die gegenseitige lage gleicher teile gewisser zeichenreihen, videnskapsselskapets skrifter, I., Mat.-naturv. klasse, 1-67, (1912), Kristiania · 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.