Loops and overloops for tree walking automata

Authors:
Pierre-Cyrille Héam;Vincent Hugot;Olga Kouchnarenko
Affiliations:
LIFC, Université de Franche-Comté & INRIA, CASSIS, Besançon, France;LIFC, Université de Franche-Comté & INRIA, CASSIS, Besançon, France;LIFC, Université de Franche-Comté & INRIA, CASSIS, Besançon, France
Venue:
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Year:
2011

Citing 7
Cited 1

Decidable optimization problems for database logic programs

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Validating streaming XML documents

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Tree-walking automata do not recognize all regular languages

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Tree-walking automata cannot be determinized

Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Tree-Walking Automata

Language and Automata Theory and Applications
Random Generation of Deterministic Tree (Walking) Automata

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Transitive closure logic, nested tree walking automata, and XPath

Journal of the ACM (JACM)

Loops and overloops for Tree-Walking Automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.