Typechecking for XML transformers
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Web Odyssey: from Codd to XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Extended path expressions of XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Towards static type checking for XSLT
DocEng '01 Proceedings of the 2001 ACM Symposium on Document engineering
ACM SIGMOD Record
Syntax-Directed Semantics: Formal Models Based on Tree Transducers
Syntax-Directed Semantics: Formal Models Based on Tree Transducers
Typechecking Top-Down Uniform Unranked Tree Transducers
ICDT '03 Proceedings of the 9th International Conference on Database Theory
XDuce: A Typed XML Processing Language (Preliminary Report)
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
The Complexity of Compositions of Deterministic Tree Transducers
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Typechecking for XML transformers
Journal of Computer and System Sciences - Special issue on PODS 2000
XML type checking with macro tree transducers
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Regular expression filters for XML
Journal of Functional Programming
XML transformation by tree-walking transducers with invisible pebbles
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Multi-Return Macro Tree Transducers
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Type-based specialization of xml transformations
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Deciding equivalence of top--down XML transformations in polynomial time
Journal of Computer and System Sciences
Towards practical typechecking for macro tree transducers
DBPL'07 Proceedings of the 11th international conference on Database programming languages
A learning algorithm for top-down XML transformations
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rewrite-based verification of XML updates
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
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
Exact XML type checking in polynomial time
ICDT'07 Proceedings of the 11th international conference on Database Theory
Computing transitive closures of hedge transformations
International Journal of Critical Computer-Based Systems
A pushdown machine for recursive XML processing
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Macro tree transformations of linear size increase achieve cost-optimal parallelism
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Visibly pushdown transducers with look-ahead
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Computing transitive closures of hedge transformations
VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Hi-index | 0.89 |
XML documents conceptually are not trees, but forests. Therefore, we extend the concept of macro tree transducers (mtt's) to a transformation formalism of forests, macro forest transducers (mft's). We show that mft's form a strict superset of mtt's operating on forests (represented as binary trees). On the other hand, the transformation of every mft can be simulated by the composition of two mtt's. Although macro forest transducers are more powerful, the complexity of inverse type inference, i.e., computing the pre-image of a recognizable language, is almost the same as for tree transducers.