43 search results - page 3 / 9 » Minimizing Tree Automata for Unranked Trees |
ICDT
2003
ACM
13 years 11 months ago
2003
ACM
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
LICS
2007
IEEE
14 years 2 days ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
ADBIS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We propose a descriptive high-level language XDTrans devoted to specify transformations over XML data. The language is based on unranked tree automata approach. In contra...
AMW
2011
12 years 9 months ago
2011
Since navigational aspects of XPath correspond to first-order definability, it has been proposed to use the analogy with the very successful technique of translating LTL into aut...
ICDT
2012
ACM
11 years 8 months ago
2012
ACM
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...