Sharp characterizations of squarefree morphisms
From MaRDI portal
Publication:1162827
DOI10.1016/0304-3975(82)90023-8zbMath0482.68085OpenAlexW2078226209WikidataQ61677998 ScholiaQ61677998MaRDI QIDQ1162827
Publication date: 1982
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(82)90023-8
Related Items
Square-free words on partially commutative free monoids ⋮ Repetition-free words ⋮ Primitive morphisms ⋮ Overlap-free morphisms and finite test-sets ⋮ A powerful abelian square-free substitution over 4 letters ⋮ Letter frequency in infinite repetition-free words ⋮ On the entropy and letter frequencies of powerfree words ⋮ Avoiding letter patterns in ternary square-free words ⋮ Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms ⋮ Unnamed Item ⋮ Reduction in non-(k+ 1)-power-free morphisms ⋮ Lengths of irreducible and delicate words ⋮ Estimates in Shirshov height theorem ⋮ Nonrepetitive colorings of trees ⋮ Infinite ternary square-free words concatenated from permutations of a single word ⋮ Avoiding square-free words on free groups ⋮ Square-free words obtained from prefixes by permutations ⋮ If a DOL language is k-power free then it is circular ⋮ On the number of partially abelian square-free words on a three-letter alphabet ⋮ A uniform cube-free morphism isk-power-free for all integersk≥ 4 ⋮ Square-free shuffles of words ⋮ On square-free arithmetic progressions in infinite words ⋮ Prefix-primitivity-preserving homomorphisms ⋮ Disposability in square-free words ⋮ There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\) ⋮ The entropy of square-free words ⋮ Pattern avoidance: themes and variations ⋮ Binary codes that do not preserve primitivity ⋮ Periodicity, repetitions, and orbits of an automatic sequence ⋮ Abelian squares are avoidable on 4 letters ⋮ Some further results on squarefree arithmetic progressions in infinite words ⋮ Some non finitely generated monoids of repetition-free endomorphisms. ⋮ A characterization of overlap-free morphisms ⋮ On the product of square-free words ⋮ On regularity of languages generated by copying systems ⋮ A characterization of power-free morphisms ⋮ Binary codes that do not preserve primitivity ⋮ Some results on \(k\)-power-free morphisms ⋮ A test-set fork-power-free binary morphisms
Cites Work
