A uniform cube-free morphism isk-power-free for all integersk≥ 4
From MaRDI portal
Publication:4638265
DOI10.1051/ita/2017015zbMath1453.68147OpenAlexW2785557724MaRDI QIDQ4638265
Publication date: 4 May 2018
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ita/2017015
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Avoidable patterns in strings of symbols
- Mots sans carre et morphismes iterés
- Sharp characterizations of squarefree morphisms
- Some results on \(k\)-power-free morphisms
- On cube-free \(\omega\)-words generated by binary morphisms
- Uniformly growing k-th power-free homomorphisms
- CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS
- A test-set fork-power-free binary morphisms
- Reduction in non-(k+ 1)-power-free morphisms
This page was built for publication: A uniform cube-free morphism isk-power-free for all integersk≥ 4