Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order

DOI10.1007/978-3-319-55911-7_32zbMath1485.03143arXiv1610.06027OpenAlexW2538999547MaRDI QIDQ2988842

Arthur Milchior

Publication date: 19 May 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.06027

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05)

Related Items (2)

Unnamed Item ⋮ First-Order Logic and Numeration Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Presburgerness of predicates regular in two number systems
• Logic and \(p\)-recognizable sets of integers
• The definable criterion for definability in Presburger arithmetic and its applications.
• Efficient minimization of deterministic weak \(\omega\)-automata
• A decision method for the recognizability of sets defined by number systems
• A Decision Procedure for the First Order Theory of Real Addition with Order
• On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
• A Generalization of Semenov’s Theorem to Automata over Real Numbers
• Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure
• A Generalization of Cobham’s Theorem to Automata over Real Numbers
• On the base-dependence of sets of numbers recognizable by finite automata
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order