Loops and Overloops for Tree Walking Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Loops and Overloops for Tree Walking Automata

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.

Dates and versions

hal-00641743 , version 1 (16-11-2011)

Identifiers

Cite

Pierre-Cyrille Heam, Vincent Hugot, Olga Kouchnarenko. Loops and Overloops for Tree Walking Automata. 16th International Conference on Implementation and Application of Automata - CIAA 2011, Jul 2011, Blois, France. pp.166-177, ⟨10.1007/978-3-642-22256-6_16⟩. ⟨hal-00641743⟩
150 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More