Overlap-free morphisms and finite test-sets

DOI10.1016/j.dam.2003.10.005zbMath1073.68069OpenAlexW2027308684MaRDI QIDQ1887045

Francis Wlazinski, Gwenaël Richomme

Publication date: 23 November 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.10.005

zbMATH Keywords

Combinatorics on wordsMorphismsOverlap-free wordsTest-sets

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms ⋮ Unnamed Item ⋮ Fixed points avoiding abelian \(k\)-powers ⋮ There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\) ⋮ Some non finitely generated monoids of repetition-free endomorphisms.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of power-free morphisms
• Sequences generated by infinitely iterated morphisms
• Repetition-free words
• Mots sans carre et morphismes iterés
• Sharp characterizations of squarefree morphisms
• A characterization of overlap-free morphisms
• Some results on \(k\)-power-free morphisms
• Some non finitely generated monoids of repetition-free endomorphisms.
• On some generalizations of the Thue-Morse morphism.
• Characterization of test-sets for overlap-free morphisms
• A test-set fork-power-free binary morphisms