A characterization of Sturmian morphisms

DOI10.1007/3-540-57182-5_20MaRDI QIDQ4260376zbMATH OpenFDO

Authors Jean Berstel, Patrice Séébold

Publication date 19 September 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57182-5_20

Mathematics Subject Classification ID

Automata sequences (11B85) Combinatorics on words (68R15)

Recommendations

• Sturmian morphisms
• Sturmian morphisms and Rauzy's rules
• Sturmian images of non Sturmian words and standard morphisms

Cited in

(24)

• On the conjugation of standard morphisms
• Sturmian morphisms and Rauzy's rules
• Sturmian morphisms
• Palindromes in the Fibonacci word
• Standard Sturmian morphisms
• Repetitions in Sturmian strings
• Repetitive perhaps, but certainly not boring
• Sturmian images of non Sturmian words and standard morphisms
• Substitution invariant Sturmian bisequences
• Conjugates of characteristic Sturmian words generated by morphisms
• Overlap-free morphisms and finite test-sets
• Palindromes and Sturmian words
• Sturmian morphisms and -words
• On the asymptotic abelian complexity of morphic words
• Look and Say Fibonacci
• Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms
• Decimations and sturmian words
• A remark on morphic sturmian words
• scientific article; zbMATH DE number 2102765 (Why is no real title available?)
• Automatic sequences and generalised polynomials
• Episturmian words: a survey
• On Substitutions Preserving Their Return Sets
• On a combinatorial property of Sturmian words
• Morphisms and BWT-run sensitivity

This page was built for publication: A characterization of Sturmian morphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4260376)