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.
Type de document :
Article dans une revue
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〉
Liste complète des métadonnées

Littérature citée [1 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01676466
Contributeur : Arthur Milchior <>
Soumis le : vendredi 5 janvier 2018 - 16:10:26
Dernière modification le : mardi 9 janvier 2018 - 01:10:22
Document(s) archivé(s) le : mercredi 23 mai 2018 - 13:56:38

Fichier

tamc2017.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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〉

Partager

Métriques

Consultations de la notice

48

Téléchargements de fichiers

19