On the base-dependence of sets of numbers recognizable by finite automata
From MaRDI portal
Publication:5569462
DOI10.1007/BF01746527zbMATH Open0179.02501DBLPjournals/mst/Cobham69WikidataQ29028187 ScholiaQ29028187MaRDI QIDQ5569462FDOQ5569462
Authors: Alan Cobham 
Publication date: 1969
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Cites Work
Cited In (only showing first 100 items - show all)
- SELF-SIMILAR STRUCTURE OF RESCALED EVOLUTION SETS OF CELLULAR AUTOMATA II
- Title not available (Why is that?)
- Spectra and satisfiability for logics with successor and a unary function
- Syntactical and automatic properties of sets of polynomials over finite fields
- Finite transducers for divisibility monoids
- Path sets in one-sided symbolic dynamics
- Bertrand numeration systems and recognizability
- Asymptotic properties of free monoid morphisms
- Mots sans carre et morphismes iterés
- The growth ratio of synchronous rational relations is unique
- Uniform tag sequences
- On vanishing coefficients of algebraic power series over fields of positive characteristic
- Function fields in positive characteristic: expansions and Cobham's theorem
- Recognizable sets of numbers in nonstandard bases
- Hyperquadratic continued fractions and automatic sequences
- Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem
- Arithmetics properties of substitutions and infinite automata
- Linear cellular automata, finite automata and Pascal's triangle
- A short proof of a theorem of Cobham on substitutions
- Self-similar tiling systems, topological factors and stretching factors
- Transcendence of power series for some number theoretic functions
- The ring of \(k\)-regular sequences
- On iterating linear transformations over recognizable sets of integers
- How to prove that a sequence is not automatic
- On recognizable sets of integers
- Transcendence of formal power series with rational coefficients
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
- A multi-dimensional analogue of Cobham’s theorem for fractals
- The signature of rational languages
- Subword complexity and non-automaticity of certain completely multiplicative functions
- Invertible substitutions and local isomorphisms
- The ring of \(k\)-regular sequences. II.
- Some explicit continued fraction expansions
- Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series
- A generalization of Cobham's theorem to automata over real numbers
- Independent numeration systems and syndeticity
- 2- and 3-Mahler recurrences
- Automata and algebraicity
- Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
- On the context-freeness of the set of words containing overlaps
- The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable
- Papers presented at the conference `XXIIIrd Journées Arithmétiques', Graz, Austria, July 6--12, 2003
- Counting the solutions of Presburger equations without enumerating them.
- An extension of the Cobham-Semënov Theorem
- Syndeticity and independent substitutions
- Uniform tag systems for paperfolding sequences
- An analogue of Cobham’s theorem for fractals
- Properties and limits of recognition of sets of integers by countable automata
- The minimal growth of a \(k\)-regular sequence
- On multiplicatively dependent linear numeration systems, and periodic points
- Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
- Cobham's theorem and its extensions
- Hybrid quasicrystals, transport and localization in products of minimal sets
- Sur le développement en fraction continue de la série de Baum et Sweet
- Title not available (Why is that?)
- Dynamical directions in numeration
- On automatic subsets of the Gaussian integers
- Multi-dimensional sets recognizable in all abstract numeration systems
- Automaticity of double sequences generated by one-dimensional linear cellular automata
- Sur la transcendance de la série formelle Π
- Suites algébriques, automates et substitutions
- Bases and ambiguity of number systems
- An analogue of Cobham's theorem for graph directed iterated function systems
- Automatic maps in exotic numeration systems
- Presburgerness of predicates regular in two number systems
- Logical characterization of recognizable sets of polynomials over a finite field
- The definable criterion for definability in Presburger arithmetic and its applications.
- A list of arithmetical structures complete with respect to the first-order definability
- On certain recurrent and automatic sequences in finite fields
- On number systems with finite degree of ambiguity
- Thue, combinatorics on words, and conjectures inspired by the Thue-Morse sequence
- Star-free sets of integers
- On the factors of automatic words
- Joining \(k\)- and \(l\)-recognizable sets of natural numbers
- Rudin-Shapiro Sums via Automata Theory and Logic
- Quotients of palindromic and antipalindromic numbers
- Hartmanis-Stearns Conjecture on Real Time and Transcendence
- Title not available (Why is that?)
- Sum of digits and change of base
- A Generalization of Semenov’s Theorem to Automata over Real Numbers
- Automatic sets of rational numbers
- A more reasonable proof of Cobham's theorem
- Automatic sequences and generalised polynomials
- Multiplicative automatic sequences
- A Fibonacci type sequence with Prouhet-Thue-Morse coefficients
- On \(k\)-regularity of sequences of valuations and last non-zero digits
- First-order logic and numeration systems
- Defining multiplication in some additive expansions of polynomial rings
- Robustness of Pisot-regular sequences
- A sufficient condition for \(\theta^{N}_N\) to have a distribution modulo one, when \(\theta\) is in \(\mathbb F_2(X)\)
- European Summer Meeting of the Association for Symbolic Logic
- Ostrowski-automatic sequences: theory and applications
- An asymptotic version of Cobham’s theorem
- Büchi automata recognizing sets of reals definable in first-order logic with addition and order
- Life and Mathematics of Alfred Jacobus van der Poorten (1942–2010)
- Ultimate periodicity problem for linear numeration systems
- It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base
- Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts
- Is the full susceptibility of the square-lattice Ising model a differentially algebraic function?
- Title not available (Why is that?)
This page was built for publication: On the base-dependence of sets of numbers recognizable by finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5569462)
