An analogue of Cobham’s theorem for fractals
From MaRDI portal
Publication:3020345
DOI10.1090/S0002-9947-2011-05357-2zbMath1229.28007MaRDI QIDQ3020345
Boris Adamczewski, Jason P. Bell
Publication date: 4 August 2011
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Related Items (13)
Generalized Pascal triangle for binomial coefficients of words ⋮ Unnamed Item ⋮ A sequential view of self--similar measures, or, What the ghosts of Mahler and Cantor can teach us about dimension ⋮ On Multiplicative Independent Bases for Canonical Number Systems in Cyclotomic Number Fields ⋮ Automatic Sets of Rational Numbers ⋮ An asymptotic version of Cobham’s theorem ⋮ First-Order Logic and Numeration Systems ⋮ Cobham's theorem for substitutions ⋮ A multi-dimensional analogue of Cobham’s theorem for fractals ⋮ How to avoid a compact set ⋮ Substitutive systems and a finitary version of Cobham's theorem ⋮ The entropy and Hausdorff dimension of self-similar sets ⋮ An analogue of Cobham's theorem for graph directed iterated function systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite automata and algebraic extensions of functions fields
- Self-similar tiling systems, topological factors and stretching factors
- A generalization of Cobham's theorem to automata over real numbers
- Automaticity of double sequences generated by one-dimensional linear cellular automata
- Limit sets of automatic sequences.
- Linear cellular automata, finite automata and Pascal's triangle
- On the complexity of algebraic numbers. I: Expansions in integer bases
- Real and p-adic expansions involving symmetric patterns
- Hausdorff Dimension in Graph Directed Constructions
- Some suggestions for further research
- Automatic Sequences
- SELF-SIMILAR STRUCTURE OF RESCALED EVOLUTION SETS OF CELLULAR AUTOMATA I
- SELF-SIMILAR STRUCTURE OF RESCALED EVOLUTION SETS OF CELLULAR AUTOMATA II
- Disjointness in ergodic theory, minimal sets, and a problem in diophantine approximation
- Sets of Numbers Defined by Finite Automata
- On the base-dependence of sets of numbers recognizable by finite automata
This page was built for publication: An analogue of Cobham’s theorem for fractals
