Reduction in non-(k+ 1)-power-free morphisms

DOI10.1051/ita/2016006zbMath1362.68243OpenAlexW2410878689MaRDI QIDQ3186671

Francis Wlazinski

Publication date: 12 August 2016

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ita/2016006

zbMATH Keywords

word morphismpower-free word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (1)

A uniform cube-free morphism isk-power-free for all integersk≥ 4

Cites Work

• On k-repetition freeness of length uniform morphisms over a binary alphabet
• There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\)
• A characterization of power-free morphisms
• 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
• Sur un théorème de Thue
• CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS
• A test-set fork-power-free binary morphisms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reduction in non-(k+ 1)-power-free morphisms