Pushdown machines for the macro tree transducer
Theoretical Computer Science
Science of Computer Programming
Handbook of formal languages, vol. 3
A syntax directed compiler for ALGOL 60
Communications of the ACM
A Web Odyssey: from Codd to XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Compiler Design
Syntax-Directed Semantics: Formal Models Based on Tree Transducers
Syntax-Directed Semantics: Formal Models Based on Tree Transducers
A formal model for an expressive fragment of XSLT
Information Systems - Databases: Creation, management and utilization
Structured Document Transformations Based on XSL
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
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
Complementing deterministic tree-walking automata
Information Processing Letters
Circularity, composition, and decomposition results for pebble macro tree transducers
Journal of Automata, Languages and Combinatorics
Expressive power of pebble automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Hi-index | 0.00 |
We consider pebble macro tree transducers with call-by-name semantics and strong pebble handling. The latter means that the last dropped pebble can be lifted regardless of the position of the reading head. This tree transducer concept is a generalization of the pebblemacro tree transducer introduced by J. Engelfriet and S. Maneth in 2003, however we leave the original name untouched. Our main results are that (1) every n-pebble macro tree transformation can be characterized by the composition of an n-pebble tree transformation and a yield tree transformation, and (2) each n-pebble tree transformation can also be computed by an (n − 1)-pebble macro tree transformation. Using (1) and (2) we prove that every n-pebblemacro tree transformation appears as the composition of n+2 stay-macro tree transformations and hence, the inverses of n-pebble macro tree transformations preserve regularity. Finally, using the previous results, we show that the type checking problem for n-pebble macro tree transducers is decidable.