A characterization of power-free morphisms

DOI10.1016/0304-3975(85)90213-0zbMath0572.68066OpenAlexW2074361486MaRDI QIDQ1062467

Michel Leconte

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90213-0

zbMATH Keywords

power-free words

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (11)

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 ⋮ Reduction in non-(k+ 1)-power-free morphisms ⋮ If a DOL language is k-power free then it is circular ⋮ A uniform cube-free morphism isk-power-free for all integersk≥ 4 ⋮ CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS ⋮ Periodicity, repetitions, and orbits of an automatic sequence ⋮ Abelian squares are avoidable on 4 letters ⋮ Some results on \(k\)-power-free morphisms ⋮ A test-set fork-power-free binary morphisms

Cites Work

• Avoidable patterns in strings of symbols
• Sharp characterizations of squarefree morphisms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A characterization of power-free morphisms