Loops and Overloops for Tree Walking Automata

Pierre-Cyrille Heam 1, 2 Vincent Hugot 2 Olga Kouchnarenko 2
2 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Tree Walking Automata (TWA) have lately received renewed interest thanks to their tight connection to XML. This paper introduces the notion of tree overloops, which is closely related to tree loops, and investigates the use of both for the following common operations on TWA: testing membership, transformation into a Bottom-Up Tree Automaton (BUTA), and testing emptiness. Notably, we argue that transformation into a BUTA is slightly less straightforward than was assumed, show that using overloops yields much smaller BUTA in the deterministic case, and provide a polynomial over-approximation of this construction which detects emptiness with surprising accuracy against randomly generated TWA.
Type de document :
Communication dans un congrès
Béatrice Bouchou-Markhoff and Pascal Caron and Jean-Marc Champarnaud and Denis Maurel. 16th International Conference on Implementation and Application of Automata - CIAA 2011, Jul 2011, Blois, France. Springer, 6807, pp.166-177, 2011, Lecture Notes in Computer Science. 〈http://www.springerlink.com/content/h290628683x8m067/?CFID=57598311&CFTOKEN=33561544〉. 〈10.1007/978-3-642-22256-6_16〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00641743
Contributeur : Pierre-Cyrille Heam <>
Soumis le : mercredi 16 novembre 2011 - 15:24:20
Dernière modification le : vendredi 6 juillet 2018 - 15:06:10

Lien texte intégral

Identifiants

Citation

Pierre-Cyrille Heam, Vincent Hugot, Olga Kouchnarenko. Loops and Overloops for Tree Walking Automata. Béatrice Bouchou-Markhoff and Pascal Caron and Jean-Marc Champarnaud and Denis Maurel. 16th International Conference on Implementation and Application of Automata - CIAA 2011, Jul 2011, Blois, France. Springer, 6807, pp.166-177, 2011, Lecture Notes in Computer Science. 〈http://www.springerlink.com/content/h290628683x8m067/?CFID=57598311&CFTOKEN=33561544〉. 〈10.1007/978-3-642-22256-6_16〉. 〈hal-00641743〉

Partager

Métriques

Consultations de la notice

298