Deterministic Automata for Unordered Trees

Boiret, Adrien; Hugot, Vincent; Niehren, Joachim; Treinen, Ralf

Document type :

Communication dans un congrès avec actes

DOI :

10.4204/EPTCS.161.17

Title :

Deterministic Automata for Unordered Trees

Author(s) :

Boiret, Adrien [Auteur]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Linking Dynamic Data [LINKS ]
Hugot, Vincent [Auteur]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Linking Dynamic Data [LINKS ]
Niehren, Joachim [Auteur]

Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Linking Dynamic Data [LINKS ]
Treinen, Ralf [Auteur]
Preuves, Programmes et Systèmes [PPS]

Conference title :

Fifth International Symposium on Games, Automata, Logics and Formal Verification (Gandalf)

City :

Verona

Country :

Italie

Start date of the conference :

2014-09-10

Publisher :

EPTCS

Publication date :

2014-09-10

HAL domain(s) :

Informatique [cs]/Informatique et langage [cs.CL]

English abstract : [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 ...
Show more >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>Show less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

ANR Project :

Correction de scripts Linux

Collections :