Sturmian images of non Sturmian words and standard morphisms

DOI10.1016/j.tcs.2017.11.011zbMath1393.68145OpenAlexW2768503191MaRDI QIDQ1698732

Patrice Séébold

Publication date: 16 February 2018

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.11.011

zbMATH Keywords

Sturmian wordsD0L systemsFibonacci wordSturmian morphismsstandard morphismsHD0L systems

Mathematics Subject Classification ID

Combinatorics on words (68R15) Grammars and rewriting systems (68Q42) Automata sequences (11B85)

Related Items (2)

On the Stern-Brocot expansion of real numbers ⋮ Morphic words, Beatty sequences and integer images of the Fibonacci language

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms
• Substitutions in dynamics, arithmetics and combinatorics
• Sequences generated by infinitely iterated morphisms
• On the conjugation of standard morphisms
• Mots sans carre et morphismes iterés
• Sturmian morphisms and Rauzy's rules
• Invariance properties of Sturmian words
• Conjugacy and episturmian morphisms.
• Conjugation of standard morphisms and a generalization of singular words
• Automatic Sequences
• The equality problem for purely substitutive words
• Uniform tag sequences

This page was built for publication: Sturmian images of non Sturmian words and standard morphisms