Syndeticity and independent substitutions

DOI10.1016/J.AAM.2008.02.001zbMath1160.68028arXiv0907.4583OpenAlexW2964066418MaRDI QIDQ2377960

Fabien Durand, Michel Rigo

Publication date: 20 January 2009

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

Full work available at URL: https://arxiv.org/abs/0907.4583

zbMATH Keywords

substitutionsCobham's theorempolynomial growth orderabstract numeration systems

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Automata sequences (11B85)

Related Items (11)

Asymptotic properties of free monoid morphisms ⋮ Dynamics of interval maps generated by erasing substitutions ⋮ The simplest erasing substitution ⋮ On extended boundary sequences of morphic and Sturmian words ⋮ Mixing properties of erasing interval maps ⋮ Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms ⋮ An asymptotic version of Cobham’s theorem ⋮ Some remarks about stabilizers ⋮ Rigidity and Substitutive Dendric Words ⋮ The growth function of \(S\)-recognizable sets ⋮ DECIDABILITY OF UNIFORM RECURRENCE OF MORPHIC SEQUENCES

Cites Work

• Unnamed Item
• Unnamed Item
• Substitution dynamical systems - spectral analysis
• On recognizable sets of integers
• Independent numeration systems and syndeticity
• Bertrand numeration systems and recognizability
• Complexité des facteurs des mots infinis engendrés par morphismes itérés
• Automatic Sequences
• A theorem of Cobham for non-primitive substitutions
• An Introduction to Symbolic Dynamics and Coding
• On the base-dependence of sets of numbers recognizable by finite automata
• Uniform tag sequences
• Numeration systems on a regular language

This page was built for publication: Syndeticity and independent substitutions