Skip to Main content Skip to Navigation
Journal articles

Loops and overloops for Tree Walking Automata

Pierre-Cyrille Heam 1, 2 Vincent Hugot 1, 2 Olga Kouchnarenko 1, 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 Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : Tree-Walking Automata (TWA) have lately received renewed interest thanks to their tight connection to XML. This paper introduces the notion of treeoverloops, which is closely related to treeloops, 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 the transformation into a BUTA is slightly less straightforward than was previously 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.
Complete list of metadata
Contributor : Pierre-Cyrille Heam <>
Submitted on : Friday, November 23, 2012 - 10:56:18 AM
Last modification on : Friday, January 8, 2021 - 11:22:05 AM

Links full text



Pierre-Cyrille Heam, Vincent Hugot, Olga Kouchnarenko. Loops and overloops for Tree Walking Automata. Theoretical Computer Science, Elsevier, 2012, Implementation and Application of Automata (CIAA 2011), 450, pp.43-53. ⟨10.1016/j.tcs.2012.04.026⟩. ⟨hal-00756514⟩



Record views