Deterministic Automata for Unordered Trees
Type de document :
Communication dans un congrès avec actes
DOI :
Titre :
Deterministic Automata for Unordered Trees
Auteur(s) :
Boiret, Adrien [Auteur]
Linking Dynamic Data [LINKS ]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Hugot, Vincent [Auteur]
Linking Dynamic Data [LINKS ]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Niehren, Joachim [Auteur]
Linking Dynamic Data [LINKS ]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Treinen, Ralf [Auteur]
Preuves, Programmes et Systèmes [PPS]
Linking Dynamic Data [LINKS ]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Hugot, Vincent [Auteur]
Linking Dynamic Data [LINKS ]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Niehren, Joachim [Auteur]
Linking Dynamic Data [LINKS ]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Treinen, Ralf [Auteur]
Preuves, Programmes et Systèmes [PPS]
Titre de la manifestation scientifique :
Fifth International Symposium on Games, Automata, Logics and Formal Verification (Gandalf)
Ville :
Verona
Pays :
Italie
Date de début de la manifestation scientifique :
2014-09-10
Éditeur :
EPTCS
Date de publication :
2014-09-10
Discipline(s) HAL :
Informatique [cs]/Informatique et langage [cs.CL]
Résumé en anglais : [en]
Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in JSON or XML format. While the existing notions are well-investigated concerning expressiveness, they all lack a proper ...
Lire la suite >Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in JSON or XML format. While the existing notions are well-investigated concerning expressiveness, they all lack a proper notion of determinism, which makes it difficult to distinguish subclasses of automata for which problems such as inclusion, equivalence, and minimization can be solved efficiently. In this paper, we propose and investigate different notions of ''horizontal determinism'', starting from automata for unranked trees in which the horizontal evaluation is performed by finite state automata. We show that a restriction to confluent horizontal evaluation leads to polynomial-time emptiness and universality, but still suffers from coNP-completeness of the emptiness of binary intersections. Finally, efficient algorithms can be obtained by imposing an order of horizontal evaluation globally for all automata in the class. Depending on the choice of the order, we obtain different classes of automata, each of which has the same expressiveness as CMSO. <p> <a href="https://hal.inria.fr/hal-01179493"> An extended version is available here</a></p>Lire moins >
Lire la suite >Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in JSON or XML format. While the existing notions are well-investigated concerning expressiveness, they all lack a proper notion of determinism, which makes it difficult to distinguish subclasses of automata for which problems such as inclusion, equivalence, and minimization can be solved efficiently. In this paper, we propose and investigate different notions of ''horizontal determinism'', starting from automata for unranked trees in which the horizontal evaluation is performed by finite state automata. We show that a restriction to confluent horizontal evaluation leads to polynomial-time emptiness and universality, but still suffers from coNP-completeness of the emptiness of binary intersections. Finally, efficient algorithms can be obtained by imposing an order of horizontal evaluation globally for all automata in the class. Depending on the choice of the order, we obtain different classes of automata, each of which has the same expressiveness as CMSO. <p> <a href="https://hal.inria.fr/hal-01179493"> An extended version is available here</a></p>Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Projet ANR :
Collections :
Source :
Fichiers
- https://hal.inria.fr/hal-01020236/document
- Accès libre
- Accéder au document
- http://arxiv.org/pdf/1408.5966
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-01020236/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- det-unordered.pdf
- Accès libre
- Accéder au document
- 1408.5966
- Accès libre
- Accéder au document