Undecidable properties of deterministic top-down tree transducers
Theoretical Computer Science
Decidability of the finiteness of ranges of tree transductions
Information and Computation
The generating power of total deterministic tree transducer
Information and Computation
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Macro tree transducers, attribute grammars, and MSO definable tree translations
Information and Computation
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The intrinsically exponential complexity of the circularity problem for attribute grammars
Communications of the ACM
Characterizing and Deciding MSO-Definability of Macro Tree Transductions
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Generalized2 sequential machine maps
Journal of Computer and System Sciences
Typechecking Top-Down Uniform Unranked Tree Transducers
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Logic as a Query Language: From Frege to XML
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Attribute grammars for unranked trees as a query language for structured documents
Journal of Computer and System Sciences
Properties of visibly pushdown transducers
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
The complexity of text-preserving XML transformations
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Optimization of XSLT by compact specialization and combination
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
A framework for integrating XML transformations
ER'06 Proceedings of the 25th international conference on Conceptual Modeling
Pebble Macro Tree Transducers with Strong Pebble Handling
Fundamenta Informaticae
| Hi-index | 0.01 |
Based on the recursion mechanism of the XML transformation language XSL, the document transformation language DTL is defined. First the instantiation DTLreg is considered that uses regular expressions as pattern language. This instantiation closely resembles the navigation mechanism of XSL. For DTLreg the complexity of relevant decision problems such as termination of programs, usefulness of rules and equivalence of selection patterns, is addressed. Next, a much more powerful abstraction of XSL is considered that uses monadic second-order logic formulas as pattern language (DTLmso). If DTLmso is restricted to top-down transformations (DTLdmso), then a computational model can be defined which is a natural generalization to unranked trees of topdown tree transducers with look-ahead. The look-ahead can be realized by a straightforward bottom-up pre-processing pass through the document. The size of the output of an XSL program is at most exponential in the size of the input. By restricting copying in XSL a decidable fragment of DTLdmso programs is obtained which induces transformations of linear size increase (safe DTLdmso). It is shown that the emptiness and finiteness problems are decidable for ranges of DTLdmso programs and that the ranges are closed under intersection with generalized Document Type Definitions (DTDs).