Presburgerness of predicates regular in two number systems
From MaRDI portal
Cites work
Cited in
(26)- Self-similar tiling systems, topological factors and stretching factors
- A generalization of Cobham's theorem to automata over real numbers
- On recognizable sets of integers
- Counting the solutions of Presburger equations without enumerating them.
- Semiautomatic structures
- On iterating linear transformations over recognizable sets of integers
- Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
- Lattice of definability in the order of rational numbers
- Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts
- Büchi automata recognizing sets of reals definable in first-order logic with addition and order
- Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem
- First-order logic and numeration systems
- On multiplicatively dependent linear numeration systems, and periodic points
- An extension of the Cobham-Semënov Theorem
- Theories of real addition with and without a predicate for integers
- Lattice of definability (of reducts) for integers with successor
- A Generalization of Semenov’s Theorem to Automata over Real Numbers
- scientific article; zbMATH DE number 7089069 (Why is no real title available?)
- THE BASE PROBLEM FOR D0L PARIKH SETS
- A more reasonable proof of Cobham's theorem
- A list of arithmetical structures complete with respect to the first-order definability
- On interpretations of Presburger arithmetic in Büchi arithmetics
- Addition machines, automatic functions and open problems of Floyd and Knuth
- The lattice of definability: origins, recent developments, and further directions
- Chair of Mathematical Logic and Theory of Algorithms
- Recurrence along directions in multidimensional words
This page was built for publication: Presburgerness of predicates regular in two number systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1259594)
