A test-set fork-power-free binary morphisms

DOI10.1051/ita:2001104zbMath1010.68102OpenAlexW2051434261MaRDI QIDQ3149084

Francis Wlazinski

Publication date: 24 September 2002

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

Full work available at URL: http://www.numdam.org/item?id=ITA_2001__35_5_437_0

zbMATH Keywords

binary morphism

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (6)

Overlap-free morphisms and finite test-sets ⋮ Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms ⋮ Reduction in non-(k+ 1)-power-free morphisms ⋮ A uniform cube-free morphism isk-power-free for all integersk≥ 4 ⋮ CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS ⋮ Some non finitely generated monoids of repetition-free endomorphisms.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primitive morphisms
• On k-repetition freeness of length uniform morphisms over a binary alphabet
• A characterization of power-free morphisms
• Sequences generated by infinitely iterated morphisms
• Sharp characterizations of squarefree morphisms
• A characterization of overlap-free morphisms
• Some results on \(k\)-power-free morphisms
• On cube-free \(\omega\)-words generated by binary morphisms
• Characterization of test-sets for overlap-free morphisms

This page was built for publication: A test-set fork-power-free binary morphisms