Tree Automata with Memory, Visibility and Structural Constraints

Hubert Comon-Lundh 1 Florent Jacquemard 2 Nicolas Perrin 3, 4
2 DAHU - Verification in databases
LSV - Laboratoire Spécification et Vérification [Cachan], ENS Cachan - École normale supérieure - Cachan, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8643
Abstract : Tree automata with one memory have been introduced in 2001. They generalize both pushdown (word) automata and the tree automata with constraints of equality between brothers of Bogaert and Tison. Though it has a decidable emptiness problem, the main weakness of this model is its lack of good closure properties. We propose a generalization of the visibly pushdown automata of Alur and Madhusudan to a family of tree recognizers which carry along their (bottom-up) computation an auxiliary unbounded memory with a tree structure (instead of a symbol stack). In other words, these recognizers, called visibly Tree Automata with Memory (VTAM) define a subclass of tree automata with one memory enjoying Boolean closure properties. We show in particular that they can be determinized and the problems like emptiness, inclusion and universality are decidable for VTAM. Moreover, we propose an extension of VTAM whose transitions may be constrained by structural equality and disequality tests between memories, and show that this extension preserves the good closure and decidability properties.
Type de document :
Communication dans un congrès
Helmut Seidl. 10th International Conference on Foundations of Software Science and Computation Structures (FOSSACS), Mar 2007, Braga, Portugal. Springer, 4423, pp.168-182, 2007, Lecture Notes in Computer Science. 〈http://www.springerlink.com/content/r7720vqm51248648/〉. 〈10.1007/978-3-540-71389-0_13〉
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00579009
Contributeur : Florent Jacquemard <>
Soumis le : mardi 22 mars 2011 - 22:33:57
Dernière modification le : mardi 11 septembre 2018 - 15:18:16
Document(s) archivé(s) le : jeudi 8 novembre 2012 - 12:20:36

Fichier

CJP-fossacs07.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin. Tree Automata with Memory, Visibility and Structural Constraints. Helmut Seidl. 10th International Conference on Foundations of Software Science and Computation Structures (FOSSACS), Mar 2007, Braga, Portugal. Springer, 4423, pp.168-182, 2007, Lecture Notes in Computer Science. 〈http://www.springerlink.com/content/r7720vqm51248648/〉. 〈10.1007/978-3-540-71389-0_13〉. 〈inria-00579009〉

Partager

Métriques

Consultations de la notice

239

Téléchargements de fichiers

101