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)
Random Generation of Deterministic Tree (Walking) Automata
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
The reduction of two-way automata to one-way automata
IBM Journal of Research and Development
Transitive closure logic, nested tree walking automata, and XPath
Journal of the ACM (JACM)
REGAL: a library to randomly and exhaustively generate automata
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Loops and overloops for tree walking automata
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Hi-index | 5.23 |
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 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.