Sequences generated by infinitely iterated morphisms

DOI10.1016/0166-218X(85)90077-0zbMath0583.20047MaRDI QIDQ1070044

Patrice Séébold

Publication date: 1985

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

zbMATH Keywords

infinite wordendomorphismfree monoidMorse sequence

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42)

Related Items

Overlap-free morphisms and finite test-sets ⋮ Unnamed Item ⋮ Sturmian images of non Sturmian words and standard morphisms ⋮ Bispecial factors in circular non-pushy D0L languages ⋮ If a DOL language is k-power free then it is circular ⋮ Fibonacci morphisms and Sturmian words ⋮ Unnamed Item ⋮ Growth of repetition-free words -- a review ⋮ WORDS AVOIDING $\frac{7}{3}$-POWERS AND THE THUE–MORSE MORPHISM ⋮ On some generalizations of the Thue-Morse morphism. ⋮ A characterization of overlap-free morphisms ⋮ Some results on \(k\)-power-free morphisms ⋮ A test-set fork-power-free binary morphisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mots sans carre et morphismes iterés
• The Morse sequence and iterated morphisms
• An optimal algorithm for computing the repetitions in a word
• A combinatorial property of the Fibonacci words
• On repetitions of blocks in binary sequences
• On cube-free \(\omega\)-words generated by binary morphisms
• Unending chess, symbolic dynamics and a problem in semi-groups
• Binary Sequences which Contain no BBb
• A Characterization of the Morse Minimal Set