Automatic sets of rational numbers
From MaRDI portal
Abstract: The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.
Recommendations
Cites work
- A generalization of Cobham's theorem to automata over real numbers
- An analogue of Cobham’s theorem for fractals
- Definability and decision problems in arithmetic
- On the base-dependence of sets of numbers recognizable by finite automata
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
- Periodic sets of integers
- Sets of Numbers Defined by Finite Automata
- Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem
- Uniform tag sequences
Cited in
(9)- \(F\)-sets and finite automata
- The upper density of an automatic set is rational
- Iterated pushdown automata and sequences of rational numbers
- k-automatic sets of rational numbers
- When is an automatic set an additive basis?
- Some properties of regular and rational sets
- Quotients of palindromic and antipalindromic numbers
- On automatic subsets of the Gaussian integers
- Properties and limits of recognition of sets of integers by countable automata
This page was built for publication: Automatic sets of rational numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947958)
