scientific article; zbMATH DE number 2080402

MaRDI QIDQ4473157zbMATH OpenFDO

Authors Sebastian Maneth, Frank Neven

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1949/19490080.htm

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• On the tree-transformation power of XSLT
• A formal model for an expressive fragment of XSLT
• On the complexity of typechecking top-down XML transformations
• A simple and efficient step towards type-correct XSLT transformations
• scientific article; zbMATH DE number 1954115

Cited in

(30)

• Deciding equivalence of top-down XML transformations in polynomial time
• Macro forest transducers
• Cut and paste
• A theoretical foundation of the DSSSL location model
• Typechecking for XML transformers
• A formal model for an expressive fragment of XSLT
• Query automata over finite trees
• Attribute grammars for unranked trees as a query language for structured documents
• XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
• Weighted path queries on semistructured databases
• scientific article; zbMATH DE number 1696860 (Why is no real title available?)
• Learnability of XML document transformation rules using typed EFSs
• Transforming XML Documents using fxt
• Extended structural recursion and XSLT
• Serial transformations of XML. Problems, methods, solutions
• Xord: An Implementation Framework for Efficient XSLT Processing
• scientific article; zbMATH DE number 1110833 (Why is no real title available?)
• scientific article; zbMATH DE number 1117901 (Why is no real title available?)
• Translating XQuery into XSLT
• scientific article; zbMATH DE number 1954115 (Why is no real title available?)
• GETGRATS: a summary of scientific results (with annotated bibliography)
• A simple and efficient step towards type-correct XSLT transformations
• On the complexity of typechecking top-down XML transformations
• XSLT Version 2.0 Is Turing-Complete: A Purely Transformation Based Proof
• Branching synchronization grammars with nested tables
• On the tree-transformation power of XSLT
• Automata for XML -- a survey
• Frontiers of tractability for typechecking simple XML transformations
• Look-ahead removal for total deterministic top-down tree transducers
• Typechecking top-down XML transformations: Fixed input or output schemas

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473157)