A characterization of overlap-free morphisms

DOI10.1016/0166-218X(93)90107-YzbMath0824.68093OpenAlexW2062993376MaRDI QIDQ1308744

Jean Berstel, Patrice Séébold

Publication date: 10 December 1993

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

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90107-y

zbMATH Keywords

Thue-Morse sequence

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items

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 ⋮ Transcendence of numbers with a low complexity expansion ⋮ A Note on Squares in Binary Words ⋮ Deciding context equivalence of binary overlap-free words in linear time ⋮ Characterization of test-sets for overlap-free morphisms ⋮ There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\) ⋮ Borderedness-preserving homomorphisms ⋮ WORDS AVOIDING $\frac{7}{3}$-POWERS AND THE THUE–MORSE MORPHISM ⋮ Algebraic irrational binary numbers cannot be fixed points of non-trivial constant length or primitive morphisms ⋮ Transcendence of Thue-Morse continued fractions ⋮ On some generalizations of the Thue-Morse morphism. ⋮ Some results on \(k\)-power-free morphisms ⋮ A test-set fork-power-free binary morphisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sequences generated by infinitely iterated morphisms
• Enumeration of irreducible binary words
• Sharp characterizations of squarefree morphisms
• On cube-free \(\omega\)-words generated by binary morphisms
• Chains and fixing blocks in irreducible binary sequences
• Unending chess, symbolic dynamics and a problem in semi-groups
• Binary Sequences which Contain no BBb
• A Characterization of the Morse Minimal Set