First-order logic and numeration systems
From MaRDI portal
Recommendations
Cites work
- A Decision Procedure for the First Order Theory of Real Addition with Order
- A generalization of Cobham's theorem to automata over real numbers
- A Generalization of Semenov’s Theorem to Automata over Real Numbers
- A multi-dimensional analogue of Cobham’s theorem for fractals
- Abstract numeration systems on bounded languages and multiplication by a constant
- An analogue of Cobham's theorem for graph directed iterated function systems
- An analogue of Cobham’s theorem for fractals
- Automatic Sequences
- Automatic theorem-proving in combinatorics on words
- Bertrand numeration systems and recognizability
- Büchi automata recognizing sets of reals definable in first-order logic with addition and order
- Computability by finite automata and pisot bases
- Construction of regular languages and recognizability of polynomials
- Decidability and Enumeration for Automatic Sequences: A Survey
- Decision algorithms for Fibonacci-automatic words. I: Basic results.
- Efficient minimization of deterministic weak -automata
- Enumeration and automatic sequences
- Enumeration and decidable properties of automatic sequences
- Finite-state \(\omega\)-languages
- Formal languages, automata and numeration systems. Vol. 2. Applications to recognizability and decidability
- Greedy numeration systems and regularity
- scientific article; zbMATH DE number 4195200 (Why is no real title available?)
- scientific article; zbMATH DE number 5707089 (Why is no real title available?)
- scientific article; zbMATH DE number 3964277 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- scientific article; zbMATH DE number 1223712 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 891076 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- scientific article; zbMATH DE number 3229502 (Why is no real title available?)
- scientific article; zbMATH DE number 3397597 (Why is no real title available?)
- Logic and p-recognizable sets of integers
- Measure, topology, and fractal geometry
- Mechanical proofs of properties of the Tribonacci word
- Multi-dimensional sets recognizable in all abstract numeration systems
- Multidimensional generalized automatic sequences and shape-symmetric morphic words
- Noncommutative rational series with applications
- Number representation and finite automata
- Numeration systems on a regular language
- On Cobham's theorem
- On factors of synchronized sequences
- On synchronized sequences and their separators
- On syntactic congruences for \(\omega\)-languages
- On the base-dependence of sets of numbers recognizable by finite automata
- On the number of unbordered factors
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
- On the structures of generating iterated function systems of Cantor sets
- On theβ-expansions of real numbers
- Periodicity, repetitions, and orbits of an automatic sequence
- Presburgerness of predicates regular in two number systems
- Representations of numbers and finite automata
- Self-similar and self-affine sets: measure of the intersection of two copies
- Subword complexity and k-synchronization
- The growth function of S-recognizable sets
- The ring of k-regular sequences
- Two applications of the spectrum of numbers
- Ultimate periodicity of b-recognisable sets: a quasilinear procedure
Cited in
(6)- Robustness of Pisot-regular sequences
- Minimal automaton for multiplying and translating the Thue-Morse set
- Regular sequences and synchronized sequences in abstract numeration systems
- Büchi automata recognizing sets of reals definable in first-order logic with addition and order
- On \(\frac{p}{q}\)-recognisable sets
- Formal languages, automata and numeration systems. Vol. 2. Applications to recognizability and decidability
This page was built for publication: First-order logic and numeration systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4613547)
