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