Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts
From MaRDI portal
Publication:2474222
DOI10.1016/j.tcs.2007.10.027zbMath1133.68036arXiv0712.4337OpenAlexW1973249621MaRDI QIDQ2474222
Publication date: 5 March 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0712.4337
Combinatorics on words (68R15) Formal languages and automata (68Q45) Symbolic dynamics (37B10) Automata sequences (11B85)
Related Items (4)
Power series with coefficients from a finite set ⋮ An asymptotic version of Cobham’s theorem ⋮ A short proof of a theorem of Cobham on substitutions ⋮ AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Substitution dynamical systems - spectral analysis
- Presburgerness of predicates regular in two number systems
- On recognizable sets of integers
- Nonperiodicity implies unique composition for self-similar translationally finite tilings
- Descendants of primitive substitutions
- Logic and \(p\)-recognizable sets of integers
- A characterization of substitutive sequences using return words
- A generalization of Cobham's theorem
- Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
- Conjugacies for tiling dynamical systems
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- Weak Second‐Order Arithmetic and Finite Automata
- Substitutional dynamical systems, Bratteli diagrams and dimension groups
- Suites algébriques, automates et substitutions
- Dynamics of self-similar tilings
- Automatic Sequences
- Repetitive Delone sets and quasicrystals
- Linearly recurrent subshifts have a finite number of non-periodic subshift factors
- 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: Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts
