On stabilizers of infinite words

DOI10.1016/j.tcs.2008.03.017zbMath1145.68042OpenAlexW1968405302MaRDI QIDQ930926

Dalia Krieger

Publication date: 24 June 2008

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

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

zbMATH Keywords

morphismsinfinite wordsstabilizers

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

On the joint subword complexity of automatic sequences ⋮ The numbers of repeated palindromes in the Fibonacci and Tribonacci words ⋮ Episturmian words: a survey ⋮ A counterexample to a question of Hof, Knill and Simon ⋮ Prefixes of the Fibonacci word that end with a cube ⋮ Fixed points avoiding abelian \(k\)-powers ⋮ Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms ⋮ Morphisms generating antipalindromic words ⋮ Selfdual substitutions in dimension one ⋮ Extremal words in morphic subshifts ⋮ Some remarks about stabilizers ⋮ Rigidity and Substitutive Dendric Words ⋮ On the D0L Repetition Threshold

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the conjugation of standard morphisms
• The Morse sequence and iterated morphisms
• Sturmian morphisms and Rauzy's rules
• Conjugacy and episturmian morphisms.
• Some remarks on invertible substitutions on three letter alphabet.
• Episturmian words and episturmian morphisms
• Some non finitely generated monoids of repetition-free endomorphisms.
• Nombres algébriques et substitutions
• A remark on morphic sturmian words
• Automatic Sequences
• A Local Balance Property of Episturmian Words
• Episturmian words and some constructions of de Luca and Rauzy