134 search results - page 17 / 27 » Automata for XML - A survey |
105
click to vote
PODS
2008
ACM
15 years 12 months ago
2008
ACM
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
199
click to vote
ICDT
2010
ACM
15 years 9 months ago
2010
ACM
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
106
click to vote
LICS
2010
IEEE
14 years 10 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We de...
112
click to vote
ICALP
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...