Automatic Sets of Rational Numbers
From MaRDI portal
Publication:2947958
DOI10.1142/S0129054115500197zbMath1398.11057arXiv1110.2382MaRDI QIDQ2947958
Eric S. Rowland, Jeffrey O. Shallit
Publication date: 29 September 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.2382
Related Items (1)
Cites Work
- A generalization of Cobham's theorem to automata over real numbers
- Periodic sets of integers
- The Critical Exponent is Computable for Automatic Sequences
- An analogue of Cobham’s theorem for fractals
- Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
- Sets of Numbers Defined by Finite Automata
- On the base-dependence of sets of numbers recognizable by finite automata
- Uniform tag sequences
- Definability and decision problems in arithmetic
This page was built for publication: Automatic Sets of Rational Numbers