50 search results - page 4 / 10 » Querying Unranked Trees with Stepwise Tree Automata |
LICS
2005
IEEE
14 years 29 days ago
2005
IEEE
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of ļ¬rstorder (FO) and monadic ...
ICDT
2010
ACM
14 years 4 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...
MFCS
2009
Springer
14 years 1 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ļ...
ADL
2000
Springer
13 years 11 months ago
2000
Springer
We address the problem of tight XML schemas and propose regular tree automata to model XML data. We show that the tree automata model is more powerful that the XML DTDs and is clo...
JAPLL
2010
13 years 5 months ago
2010
We show that problems arising in static analysis of XML speciļ¬cations and transformations can be dealt with using techniques similar to those developed for static analysis of pr...