On cube-free \(\omega\)-words generated by binary morphisms

DOI10.1016/0166-218X(83)90002-1zbMath0505.03022MaRDI QIDQ1835915

Juhani Karhumäki

Publication date: 1983

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

counterexamplesubworddecidablebiprefixesFibonacci-morphism

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Word problems, etc. in computability and recursion theory (03D40) Word problems (aspects of algebraic structures) (08A50)

Related Items (45)

Repetition-free words ⋮ Relation between powers of factors and the recurrence function characterizing Sturmian words ⋮ On the structure and extendibility of \(k\)-power free words ⋮ Avoiding letter patterns in ternary square-free words ⋮ Infinite self-similar words ⋮ Reduction in non-(k+ 1)-power-free morphisms ⋮ Decision algorithms for Fibonacci-automatic Words, I: Basic results ⋮ The structure of subword graphs and suffix trees of Fibonacci words ⋮ Fibonacci numbers and words ⋮ Permutation properties and the Fibonacci semigroup ⋮ Non-repetitive words: Ages and essences ⋮ The numbers of repeated palindromes in the Fibonacci and Tribonacci words ⋮ A combinatorial theorem on $p$-power-free words and an application to semigroups ⋮ Repetitions in the Fibonacci infinite word ⋮ On a generalization of abelian equivalence and complexity of infinite words ⋮ Properties of infinite words : Recent results ⋮ Automaticity. II: Descriptional complexity in the unary case ⋮ Properties of a ternary infinite word ⋮ The number of valid factorizations of Fibonacci prefixes ⋮ Continuous 2-colorings and topological dynamics ⋮ Fixed points avoiding abelian \(k\)-powers ⋮ Automatic complexity of Fibonacci and tribonacci words ⋮ A hierarchy for circular codes ⋮ If a DOL language is k-power free then it is circular ⋮ A uniform cube-free morphism isk-power-free for all integersk≥ 4 ⋮ A canonical automaton for one-rule length-preserving string rewrite systems ⋮ On the conjugacy class of the Fibonacci dynamical system ⋮ CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS ⋮ Unnamed Item ⋮ There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\) ⋮ Fractional powers in Sturmian words ⋮ Pattern avoidance: themes and variations ⋮ Periodicity, repetitions, and orbits of an automatic sequence ⋮ The Fibonacci automorphism of free Burnside groups ⋮ Sturmian words and words with a critical exponent ⋮ Repetitive perhaps, but certainly not boring ⋮ The non-parametrizability of the word equation \(xyz=zvx\): a short proof ⋮ A characterization of overlap-free morphisms ⋮ On k-repetition freeness of length uniform morphisms over a binary alphabet ⋮ On regularity of languages generated by copying systems ⋮ On a combinatorial property of Fibonacci semigroup ⋮ Some results on \(k\)-power-free morphisms ⋮ Sequences generated by infinitely iterated morphisms ⋮ A test-set fork-power-free binary morphisms ⋮ Growth and order of automorphisms of free groups and free Burnside groups

Cites Work

• Avoidable patterns in strings of symbols
• Mots sans carre et morphismes iterés
• On the subword complexity of square-free DOL languages
• Uniformly growing k-th power-free homomorphisms
• Sur un théorème de Thue
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On cube-free \(\omega\)-words generated by binary morphisms