Properties and limits of recognition of sets of integers by countable automata
From MaRDI portal
Publication:628831
DOI10.5802/jtnb.717zbMath1211.68231MaRDI QIDQ628831
Marion Le Gonidec, Julien Cassaigne
Publication date: 7 March 2011
Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/116405
68Q45: Formal languages and automata
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the regular structure of prefix rewriting
- The theory of ends, pushdown automata, and second-order logic
- The ring of \(k\)-regular sequences
- The ring of \(k\)-regular sequences. II.
- Generalization of automatic sequences for numeration systems on a regular language
- On infinite transition graphs having a decidable monadic theory
- Substitution dynamical systems on infinite alphabets
- On the complexity of infinite words generated by countable \(q\)-automata
- Arithmetics properties of substitutions and infinite automata
- Integers with an average sum of digits
- Diophantine properties of real numbers generated by finite automata
- Drunken man infinite words complexity
- Automatic Sequences
- ON THE CONTEXT-FREENESS OF THE θ-EXPANSIONS OF THE INTEGERS
- On the Recognition of Primes by Automata
- A Remark on Acceptable Sets of Numbers
- Unrecognizable Sets of Numbers
- On the base-dependence of sets of numbers recognizable by finite automata
- Uniform tag sequences
- Finite Automata and the Set of Squares
