A comparison of pebble tree transducers with macro tree transducers

Abstract.The n-pebble tree transducer was recently proposed as a model for XML query languages. The four main results on deterministic transducers are: First, (1) the translation $\tau$ of an n-pebble tree transducer can be realized by a composition of n+1 0-pebble tree transducers. Next, the pebble tree transducer is compared with the macro tree transducer, a well-known model for syntax-directed semantics, with decidable type checking. The -pebble tree transducer can be simulated by the macro tree transducer, which, by the first result, implies that (2) $\tau$ can be realized by an (n+1)-fold composition of macro tree transducers. Conversely, every macro tree transducer can be simulated by a composition of 0-pebble tree transducers. Together these simulations prove that (3) the composition closure of n-pebble tree transducers equals that of macro tree transducers (and that of 0-pebble tree transducers). Similar results hold in the nondeterministic case. Finally, (4) the output languages of deterministic n-pebble tree transducers form a hierarchy with respect to the number n of pebbles.

[1]  Michael J. Fischer,et al.  Grammars with Macro-Like Productions , 1968, SWAT.

[2]  Sebastian Maneth,et al.  The Complexity of Compositions of Deterministic Tree Transducers , 2002, FSTTCS.

[3]  Joost Engelfriet,et al.  SOME OPEN QUESTIONS AND RECENT RESULTS ON TREE TRANSDUCERS AND TREE LANGUAGES , 1980 .

[4]  Joost Engelfriet,et al.  Tree transducers, L systems and two-way machines (Extended Abstract) , 1978, J. Comput. Syst. Sci..

[5]  Noga Alon,et al.  XML with data values: typechecking revisited , 2001, PODS '01.

[6]  Bruno Courcelle,et al.  Attribute Grammars and Recursive Program Schemes II , 1982, Theor. Comput. Sci..

[7]  Yannis Papakonstantinou,et al.  DTD inference for views of XML data , 2000, PODS.

[8]  Michal Chytil,et al.  Serial Composition of 2-Way Finite-State Transducers and Simple Programs on Strings , 1977, ICALP.

[9]  Bruno Courcelle,et al.  Attribute Grammars and Recursive Program Schemes I , 1982, Theoretical Computer Science.

[10]  Joost Engelfriet,et al.  Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations , 1999, Inf. Comput..

[11]  Tsutomu Maimiura.  Tree Automata and Attribute Grammars , 1983, Inf. Control..

[12]  Joost Engelfriet,et al.  Tree-Walking Pebble Automata , 1999, Jewels are Forever.

[13]  David Harel,et al.  Complexity Results for Two-Way and Multi-Pebble Automata and their Logics , 1996, Theor. Comput. Sci..

[14]  Zoltán Fülöp.  On attributed tree transducers , 1981, Acta Cybern..

[15]  Noga Alon,et al.  XML with data values: typechecking revisited , 2003, J. Comput. Syst. Sci..

[16]  Noga Alon,et al.  Typechecking XML views of relational databases , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[17]  Frank Neven,et al.  A formal model for an expressive fragment of XSLT , 2000, Inf. Syst..

[18]  Donald E. Knuth,et al.  Semantics of context-free languages , 1968, Mathematical systems theory.

[19]  Heiko Vogler,et al.  Synthesized and inherited functions , 1994, Acta Informatica.

[20]  Joost Engelfriet,et al.  Decidability of the Finiteness of Ranges of Tree Transductions , 1998, Inf. Comput..

[21]  Dan Suciu,et al.  Typechecking for XML transformers , 2000, J. Comput. Syst. Sci..

[22]  Jukka Paakki,et al.  Attribute grammar paradigms—a high-level methodology in language implementation , 1995, CSUR.

[23]  Joost Engelfriet,et al.  Macro Tree Translations of Linear Size Increase are MSO Definable , 2003, SIAM J. Comput..

[24]  Heiko Vogler,et al.  Synthesized and inherited functions - a new computational model for syntax-directed semantics , 1994 .

[25]  Heiko Vogler,et al.  Functional Description of the Contextual Analysis in Block-Structured Programming Languages: A Sase Study of Tree Transducers , 1991, Sci. Comput. Program..

[26]  James W. Thatcher,et al.  Generalized Sequential Machine Maps , 1970, J. Comput. Syst. Sci..

[27]  Armin Kühnemann,et al.  Benefits of Tree Transducers for Optimizing Functional Programs , 1998, FSTTCS.

[28]  G. Goos,et al.  Attribute Grammars, Applications and Systems: International Summer School Saga Prague, Czechoslovakia, June 4-13, 1991 Proceedings , 1991 .

[29]  Pierre Deransart,et al.  Attribute Grammars: Definitions, Systems and Bibliography , 1988 .

[30]  Zoltán Fülöp,et al.  Domains of partial attributed tree transducers , 2000, Inf. Process. Lett..

[31]  Joost Engelfriet,et al.  Two-Way Finite State Transducers with Nested Pebbles , 2002, MFCS.

[32]  William C. Rounds,et al.  Mappings and grammars on trees , 1970, Mathematical systems theory.

[33]  Thomas Schwentick,et al.  Towards Regular Languages over Infinite Alphabets , 2001, MFCS.

[34]  Joseph A. Goguen,et al.  Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

[35]  Janis Voigtländer.  Conditions for Efficiency Improvement by Tree Transducer Composition , 2002, RTA.

[36]  Joost Engelfriet,et al.  Output String Languages of Compositions of Deterministic Macro Tree Transducers , 2002, J. Comput. Syst. Sci..

[37]  Joost Engelfriet,et al.  Macro Tree Transducers , 1985, J. Comput. Syst. Sci..

[38]  Joost Engelfriet,et al.  Three hierarchies of transducers , 1981, Mathematical systems theory.

[39]  Anatoliy O. Buda,et al.  Generalized1.5 Sequential Machine Maps , 1979, Inf. Process. Lett..

[40]  Akihiko Tozawa.  Towards static type checking for XSLT , 2001, DocEng '01.

[41]  Dieter Maurer,et al.  Compiler Design , 2013, Springer Berlin Heidelberg.

[42]  Dan Suciu.  The XML typechecking problem , 2002, SGMD.

[43]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[44]  Joost Engelfriet,et al.  The formal power of one-visit attribute grammars , 1981, Acta Informatica.

[45]  Joost Engelfriet,et al.  Pushdown Machines for the Macro Tree Transducer , 1986, Theor. Comput. Sci..

[46]  Zoltán Fülöp,et al.  A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers , 1999, Theory of Computing Systems.

[47]  Bruno Courcelle,et al.  Fundamental Properties of Infinite Trees , 1983, Theor. Comput. Sci..

[48]  Hans-Peter Kolb,et al.  An operational and denotational approach to non-context-freeness , 2003, Theor. Comput. Sci..

[49]  J. Michaelis,et al.  On Minimalist Attribute Grammars and Macro Tree Transducers , 2001 .

[50]  Edgar T. Irons,et al.  A syntax directed compiler for ALGOL 60 , 1961, CACM.

[51]  Seymour Ginsburg,et al.  Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .

[52]  Alfred V. Aho,et al.  Translations on a context free grammar , 1969, STOC.