On the base-dependence of sets of numbers recognizable by finite automata

Cites work

scientific article; zbMATH DE number 3125787 (Why is no real title available?)
Unrecognizable Sets of Numbers
Weak Second‐Order Arithmetic and Finite Automata

Cited in

(only showing first 100 items - show all)

Sur le développement en fraction continue de la série de Baum et Sweet
Semiautomatic structures
Multi-dimensional sets recognizable in all abstract numeration systems
Addition machines, automatic functions and open problems of Floyd and Knuth
Sur la transcendance de la série formelle Π
Bases and ambiguity of number systems
Automatic maps in exotic numeration systems
An analogue of Cobham's theorem for graph directed iterated function systems
Suites algébriques, automates et substitutions
Presburgerness of predicates regular in two number systems
Logical characterization of recognizable sets of polynomials over a finite field
A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS
Tree adjunct languages as integer set recognizers†
The definable criterion for definability in Presburger arithmetic and its applications.
A method of Mahler in transcendence theory and some of its applications
The entropy and Hausdorff dimension of self-similar sets
On certain recurrent and automatic sequences in finite fields
A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems
On number systems with finite degree of ambiguity
A list of arithmetical structures complete with respect to the first-order definability
Thue, combinatorics on words, and conjectures inspired by the Thue-Morse sequence
Automata methods in transcendence
Star-free sets of integers
Support of an algebraic series as the range of a recursive sequence
On the factors of automatic words
Joining $k$- and $l$-recognizable sets of natural numbers
SELF-SIMILAR STRUCTURE OF RESCALED EVOLUTION SETS OF CELLULAR AUTOMATA II
scientific article; zbMATH DE number 7453075 (Why is no real title available?)
Spectra and satisfiability for logics with successor and a unary function
Syntactical and automatic properties of sets of polynomials over finite fields
Rudin-Shapiro Sums via Automata Theory and Logic
Path sets in one-sided symbolic dynamics
Finite transducers for divisibility monoids
Quotients of palindromic and antipalindromic numbers
Hartmanis-Stearns Conjecture on Real Time and Transcendence
Bertrand numeration systems and recognizability
Asymptotic properties of free monoid morphisms
Sum of digits and change of base
The growth ratio of synchronous rational relations is unique
Mots sans carre et morphismes iterés
scientific article; zbMATH DE number 7089069 (Why is no real title available?)
Automatic sets of rational numbers
On vanishing coefficients of algebraic power series over fields of positive characteristic
A Generalization of Semenov’s Theorem to Automata over Real Numbers
Uniform tag sequences
A more reasonable proof of Cobham's theorem
Function fields in positive characteristic: expansions and Cobham's theorem
Automatic sequences and generalised polynomials
Hyperquadratic continued fractions and automatic sequences
Multiplicative automatic sequences
Recognizable sets of numbers in nonstandard bases
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
Self-similar tiling systems, topological factors and stretching factors
A short proof of a theorem of Cobham on substitutions
A Fibonacci type sequence with Prouhet-Thue-Morse coefficients
The ring of k-regular sequences
Transcendence of power series for some number theoretic functions
On iterating linear transformations over recognizable sets of integers
How to prove that a sequence is not automatic
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
On recognizable sets of integers
Transcendence of formal power series with rational coefficients
A sufficient condition for $\theta^{N}_N$ to have a distribution modulo one, when $\theta$ is in $\mathbb F_2(X)$
The signature of rational languages
Subword complexity and non-automaticity of certain completely multiplicative functions
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
Invertible substitutions and local isomorphisms
The ring of $k$-regular sequences. II.
European Summer Meeting of the Association for Symbolic Logic
A multi-dimensional analogue of Cobham’s theorem for fractals
Ostrowski-automatic sequences: theory and applications
Some explicit continued fraction expansions
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)
An asymptotic version of Cobham’s theorem
A generalization of Cobham's theorem to automata over real numbers
Independent numeration systems and syndeticity
It is decidable whether the image of an $\mathbb N$-rational sequence has a base
Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series
2- and 3-Mahler recurrences
Cobham-Semenov theorem and $\mathbb N^d$-subshifts
Ultimate periodicity problem for linear numeration systems
Automata and algebraicity
Is the full susceptibility of the square-lattice Ising model a differentially algebraic function?
Minimal automaton for multiplying and translating the Thue-Morse set
scientific article; zbMATH DE number 7379289 (Why is no real title available?)
Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
Sur quelques classes d’applications de $N^2$ dans les ensembles finis
On the context-freeness of the set of words containing overlaps
Number theoretic aspects of regular sequences
The theory of $\langle \mathbb{N} , +, V_ k, V_ l\rangle$ is undecidable
From combinatorial games to shape-symmetric morphisms
Mock characters and the Kronecker symbol
Topological conjugacy for the Morse minimal system: an example
Counting the solutions of Presburger equations without enumerating them.

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)