Some results on \(k\)-power-free morphisms

DOI10.1016/S0304-3975(00)00437-0zbMath1014.68127OpenAlexW1990372213MaRDI QIDQ1605332

Francis Wlazinski, Gwenaël Richomme

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00437-0

zbMATH Keywords

morphismscombinatorics on words\(k\)-power-free wordstest-sets

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (10)

Overlap-free morphisms and finite test-sets ⋮ A powerful abelian square-free substitution over 4 letters ⋮ 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 ⋮ A uniform cube-free morphism isk-power-free for all integersk≥ 4 ⋮ CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS ⋮ There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\) ⋮ Some non finitely generated monoids of repetition-free endomorphisms. ⋮ A test-set fork-power-free binary morphisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of power-free morphisms
• Sequences generated by infinitely iterated morphisms
• Avoidable patterns in strings of symbols
• Mots sans carre et morphismes iterés
• Sharp characterizations of squarefree morphisms
• A characterization of overlap-free morphisms
• On cube-free \(\omega\)-words generated by binary morphisms
• Uniformly growing k-th power-free homomorphisms
• Characterization of test-sets for overlap-free morphisms
• If a DOL language is k-power free then it is circular

This page was built for publication: Some results on \(k\)-power-free morphisms