Sciweavers

48 search results - page 2 / 10
» Transformation of XML Data Using an Unranked Tree Transducer
Sort
View
PLANX
2007
13 years 6 months ago
Deciding Equivalence of Top-Down XML Transformations in Polynomial Time
Many useful XML transformations can be formulated through deterministic top-down tree transducers. A canonical form for such transducers is presented which allows to decide equiva...
Sebastian Maneth, Helmut Seidl
PLANX
2008
13 years 6 months ago
XML Type Checking for Macro Tree Transducers with Holes
Macro forest transducers (mfts) extend macro tree transducers (mtts) from ranked to unranked trees. Mfts are more powerful than mtts (operating on binary tree encodings) because t...
Sebastian Maneth, Keisuke Nakano
CORR
2006
Springer
88views Education» more  CORR 2006»
13 years 5 months ago
On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas
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...
Wim Martens, Frank Neven, Marc Gyssens
ICALP
2005
Springer
13 years 10 months ago
Logics for Unranked Trees: An Overview
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purpo...
Leonid Libkin
DBPL
1999
Springer
114views Database» more  DBPL 1999»
13 years 9 months ago
Structured Document Transformations Based on XSL
Abstract. Based on the recursion mechanism of the XML transformation language XSL, the document transformation language DTL is defined. First the instantiation DTLreg is considere...
Sebastian Maneth, Frank Neven