First-Order Logic and Numeration Systems
From MaRDI portal
Publication:4613547
DOI10.1007/978-3-319-69152-7_3zbMath1486.03055OpenAlexW2798232590MaRDI QIDQ4613547
Publication date: 24 January 2019
Published in: Trends in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-69152-7_3
Automata and formal grammars in connection with logical questions (03D05) Models of arithmetic and set theory (03C62) Basic properties of first-order languages and structures (03C07)
Related Items (4)
Robustness of Pisot-regular sequences ⋮ Minimal automaton for multiplying and translating the Thue-Morse set ⋮ Regular sequences and synchronized sequences in abstract numeration systems ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On factors of synchronized sequences
- The growth function of \(S\)-recognizable sets
- Finite-state \(\omega\)-languages
- Multidimensional generalized automatic sequences and shape-symmetric morphic words
- A generalization of Cobham's theorem to automata over real numbers
- On the structures of generating iterated function systems of Cantor sets
- The ring of \(k\)-regular sequences
- Presburgerness of predicates regular in two number systems
- Logic and \(p\)-recognizable sets of integers
- Greedy numeration systems and regularity
- On syntactic congruences for \(\omega\)-languages
- Bertrand numeration systems and recognizability
- Efficient minimization of deterministic weak \(\omega\)-automata
- Construction of regular languages and recognizability of polynomials
- Two applications of the spectrum of numbers
- On Cobham's theorem
- Periodicity, repetitions, and orbits of an automatic sequence
- An analogue of Cobham's theorem for graph directed iterated function systems
- The Critical Exponent is Computable for Automatic Sequences
- Multi-dimensional sets recognizable in all abstract numeration systems
- Enumeration and Automatic Sequences
- Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order
- An analogue of Cobham’s theorem for fractals
- On synchronized sequences and their separators
- Decision algorithms for Fibonacci-automatic Words, I: Basic results
- On theβ-expansions of real numbers
- Mechanical Proofs of Properties of the Tribonacci Word
- Self-similar and self-affine sets: measure of the intersection of two copies
- Representations of numbers and finite automata
- A Decision Procedure for the First Order Theory of Real Addition with Order
- Computability by finite automata and pisot bases
- Automatic Sequences
- ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
- On the Number of Unbordered Factors
- Decidability and Enumeration for Automatic Sequences: A Survey
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
- A Generalization of Semenov’s Theorem to Automata over Real Numbers
- Formal Languages, Automata and Numeration Systems 2
- Subword Complexity and k-Synchronization
- Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure
- Number representation and finite automata
- A multi-dimensional analogue of Cobham’s theorem for fractals
- AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS
- On the base-dependence of sets of numbers recognizable by finite automata
- Numeration systems on a regular language
This page was built for publication: First-Order Logic and Numeration Systems
