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

Abstract : This work considers encodings of non-negative reals in a fixed base, and their encoding by weak deterministic Büchi automata. A Real Number Automaton is an automaton which recognizes all encodings of elements of a set of reals. We explain in this paper how to decide in linear time whether a set of reals recognized by a given minimal weak determin-istic RNA is FO[IR; +, <, 1]-definable. Furthermore, it is explained how to compute in quasi-quadratic (respectively, quasi-linear) time an exis-tential (respectively, existential-universal) FO[IR; +, <, 1]-formula which defines the set of reals recognized by the automaton. As an additional contribution, the techniques used for obtaining our main result lead to a characterization of minimal deterministic Büchi automata accepting FO[IR; +, <, 1]-definable set.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [1 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01676466
Contributor : Arthur Milchior <>
Submitted on : Friday, January 5, 2018 - 4:10:26 PM
Last modification on : Wednesday, December 19, 2018 - 3:50:03 PM
Document(s) archivé(s) le : Wednesday, May 23, 2018 - 1:56:38 PM

File

tamc2017.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Arthur Milchior. Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order. Lecture Notes in Computer Science, Springer, 2017, Theory and Applications of Models of Computation, 10185, pp.440-454. ⟨10.1007/978-3-319-55911-7_32⟩. ⟨hal-01676466⟩

Share

Metrics

Record views

56

Files downloads

31