We define a query automaton (QA) as a deterministic two-way finite automaton over trees that has the ability to select nodes depending on the state and the ...
We propose stepwise tree automata for querying unranked trees. Stepwise tree automata can express the same monadic queries as monadic Datalog and monadic second ...
Missing: Unary | Show results with:Unary
Unary queries correspond to formulae in one free variable, and thus produce a set of nodes. E.g., extracting sets of nodes, or evaluating XPath expressions ...
Nov 16, 2010 · We propose stepwise tree automata for querying unranked trees. Stepwise tree automata can express the same monadic queries as monadic Datalog ...
This model works like a two-way tree automaton on unranked trees, has parallel copies of automata that go up and down the tree, with automata processing ...
Tree-walking automata cannot be determinized. In 31st International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, pages.
Node selecting tree automata (NSTAs) constitute a general formalism defining unary queries over trees. Basically, a node is selected by an NSTA when it is ...
This paper studies the problem of evaluating unary (or node-selecting) queries on unranked trees compressed in a natural structure-preserving way.
We define a query automaton (QA) as a deterministic two-way finite automaton over trees that has the ability to select nodes depending on the state and the ...
[PDF] Query Evaluation on Compressed Trees∗ - RWTH Aachen University
www.lics.rwth-aachen.de › global
To be able to define unary queries, we need to enhance tree automata by an additional mechanism for selecting nodes. Definition 16. A selecting σ-tree automaton ...