CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS
From MaRDI portal
Publication:3022000
DOI10.1142/S0129054104002431zbMath1067.68118WikidataQ123224066 ScholiaQ123224066MaRDI QIDQ3022000
Gwenaël Richomme, Patrice Séébold
Publication date: 22 June 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054104002431
68R15: Combinatorics on words
68Q45: Formal languages and automata
68Q70: Algebraic theory of languages and automata
Related Items
A uniform cube-free morphism isk-power-free for all integersk≥ 4, Fixed points avoiding abelian \(k\)-powers, There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\), Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms, Growth of repetition-free words -- a review, Reduction in non-(k+ 1)-power-free morphisms
Cites Work