An asymptotic version of Cobham’s theorem
From MaRDI portal
Publication:6180234
DOI10.4064/aa220927-17-8arXiv2209.09588OpenAlexW4313429513MaRDI QIDQ6180234
Publication date: 19 January 2024
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.09588
Cites Work
- Unnamed Item
- Unnamed Item
- On automatic subsets of the Gaussian integers
- Cobham's theorem for substitutions
- On the Cobham-Semenov theorem
- A generalization of Cobham's theorem to automata over real numbers
- On recognizable sets of integers
- Independent numeration systems and syndeticity
- A generalization of Cobham's theorem
- Towards a theorem of Cobham for Gaussian integers
- Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
- An analogue of Cobham's theorem for graph directed iterated function systems
- Syndeticity and independent substitutions
- Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts
- Function fields in positive characteristic: expansions and Cobham's theorem
- A generalization of Cobham's theorem for regular sequences
- The least nonzero digit of $n!$ in base $12$
- An analogue of Cobham’s theorem for fractals
- A problem about Mahler functions
- Une généralisation du théorème de Cobham
- Automatic Sequences
- A theorem of Cobham for non-primitive substitutions
- An extension of the Cobham-Semënov Theorem
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
- A Generalization of Semenov’s Theorem to Automata over Real Numbers
- A density version of Cobham’s theorem
- A multi-dimensional analogue of Cobham’s theorem for fractals
- On the base-dependence of sets of numbers recognizable by finite automata
This page was built for publication: An asymptotic version of Cobham’s theorem
