28 search results - page 3 / 6 » On the minimization of XML Schemas and tree automata for unr... |
PODS
2010
ACM
14 years 18 days ago
2010
ACM
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...
ADBIS
2004
Springer
14 years 28 days 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...
BDA
2006
13 years 9 months ago
2006
Many data on the Web are XML documents. An XML document is an unranked labelled tree. A schema for XML documents (for instance a DTD) is the specification of their internal structu...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this ge...
ICDT
2012
ACM
11 years 10 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...