Cobham's theorem for substitutions
From MaRDI portal
Publication:645357
DOI10.4171/JEMS/294zbMath1246.11073arXiv1010.4009OpenAlexW2963417818MaRDI QIDQ645357
Publication date: 14 November 2011
Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.4009
Related Items (23)
How to prove that a sequence is not automatic ⋮ Asymptotic properties of free monoid morphisms ⋮ Dynamics of interval maps generated by erasing substitutions ⋮ Hyperquadratic continued fractions and automatic sequences ⋮ Morphic sequences versus automatic sequences ⋮ Hidden automatic sequences ⋮ Mixing properties and entropy bounds of a family of Pisot random substitutions ⋮ On Multiplicative Independent Bases for Canonical Number Systems in Cyclotomic Number Fields ⋮ Quantitative estimates for the size of an intersection of sparse automatic sets ⋮ Proving results about OEIS sequences with \texttt{Walnut} ⋮ Mixing properties of erasing interval maps ⋮ A conjecture of Dekking on the dimensions of the lower central series factors of a certain just infinite Lie algebra ⋮ An asymptotic version of Cobham’s theorem ⋮ From Combinatorial Games to Shape-Symmetric Morphisms ⋮ On automatic subsets of the Gaussian integers ⋮ Rigidity and Substitutive Dendric Words ⋮ On some conjectures of P. Barry ⋮ The Formal Inverse of the Period-Doubling Sequence ⋮ Substitutive systems and a finitary version of Cobham's theorem ⋮ Sum-free sets generated by the period-\(k\)-folding sequences and some Sturmian sequences ⋮ DECIDABILITY OF UNIFORM RECURRENCE OF MORPHIC SEQUENCES ⋮ Consistent systems of linear differential and difference equations ⋮ An analogue of Cobham's theorem for graph directed iterated function systems
Cites Work
- Unnamed Item
- Unnamed Item
- The ring of \(k\)-regular sequences
- Function fields in positive characteristic: expansions and Cobham's theorem
- A generalization of Cobham's theorem for regular sequences
- An analogue of Cobham’s theorem for fractals
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
- Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem
- Automatic Sequences
- An extension of the Cobham-Semënov Theorem
- A Generalization of Cobham’s Theorem to Automata over Real Numbers
This page was built for publication: Cobham's theorem for substitutions