Tree Series Transformations that Respect Copying

Abstract We consider tree series transducers which were introduced in [EFV], and define the tree-to-tree series transformations computed by them in two different ways. One of the definitions is based on the ←-substitution of tree series taken from [EFV] while the other one is based on a new tree series substitution introduced in this paper. This new substitution is called -substitution and the main difference between the ←- and the -substitutions is that the first one does not take into account the number of the occurrences of the substitution variables while the second one does. We compare the two different ways of computing tree-to-tree series transformations and show that, for the -substitution, fundamental relations from the theory of tree transducers carry over to tree series transducers.

[1]  Arto Salomaa,et al.  Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.

[2]  U. Hebisch,et al.  Semirings: Algebraic Theory and Applications in Computer Science , 1998 .

[3]  Ferenc Gécseg,et al.  Tree Languages , 1997, Handbook of Formal Languages.

[4]  james w.thatcher,et al.  tree automata: an informal survey , 1974 .

[5]  Joost Engelfriet,et al.  Extended linear macro grammars, iteration grammars, and register programs , 1979, Acta Informatica.

[6]  Arto Salomaa,et al.  Semirings, Automata, Languages , 1985, EATCS Monographs on Theoretical Computer Science.

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

[8]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability , 1991, Theor. Comput. Sci..

[9]  Bruno Courcelle,et al.  The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic , 1997, Handbook of Graph Grammars.

[10]  Werner Damm,et al.  Combining T and level-N , 1981, MFCS.

[11]  Zoltán Ésik,et al.  Decidability results concerning tree transducers II , 1983, Acta Cybern..

[12]  H. Vogler.  Tree Transducers and Pushdown Machines , 1986 .

[13]  J. Engelfriet.  Top-down tree transducers with regular look-ahead , 1975 .

[14]  Werner Kuich.  Tree Transducers and Formal Tree Series , 1999, Acta Cybern..

[15]  Brenda S. Baker,et al.  Composition of Top-Down and Bottom-Up Tree Transductions , 1979, Inf. Control..

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

[17]  Joost Engelfriet,et al.  Modular Tree Transducers , 1991, Theor. Comput. Sci..

[18]  Heiko Vogler,et al.  The Universality of Higher-Order Attributed Tree Transducers , 2000, Theory of Computing Systems.

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

[20]  Sándor Vágvölgyi,et al.  Decidability of the inclusion in monoids generated by tree transformation classes , 1992, Tree Automata and Languages.

[21]  Jean Berstel,et al.  Rational series and their languages , 1988, EATCS monographs on theoretical computer science.

[22]  Joost Engelfriet,et al.  Bottom-up and top-down tree transformations— a comparison , 1975, Mathematical systems theory.

[23]  Helmut Seidl.  Deciding Equivalence of Finite Tree Automata , 1990, SIAM J. Comput..

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

[25]  Marcel Paul Schützenberger,et al.  On the Definition of a Family of Automata , 1961, Inf. Control..

[26]  Joost Engelfriet,et al.  Bottom-Up and Top-Down Tree Series Transformations , 2001, J. Autom. Lang. Comb..

[27]  Jean H. Gallier,et al.  Tree Pushdown Automata , 1985, J. Comput. Syst. Sci..

[28]  Joost Engelfriet,et al.  A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars , 2000, J. Comput. Syst. Sci..

[29]  Sándor Vágvölgyi,et al.  Tree Transducers with External Functions , 1993, Theor. Comput. Sci..

[30]  Zoltán Ésik,et al.  Decidability results concerning tree transducers I , 1980, Acta Cybern..

[31]  Werner Kuich,et al.  Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata , 1997, Handbook of Formal Languages.

[32]  Helmut Seidl,et al.  Single-Valuedness of Tree Transducers is Decidable in Polynomial Time , 1992, Theor. Comput. Sci..

[33]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[34]  Bruno Courcelle,et al.  Monadic Second-Order Definable Graph Transductions: A Survey , 1994, Theor. Comput. Sci..

[35]  Jan van Leeuwen,et al.  Stack Machines and Classes of Nonnested Macro Languages , 1980, JACM.

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

[37]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[38]  William Chesley Rounds.  Trees, transducers, and transformations , 1968 .

[39]  Joost Engelfriet,et al.  A Characterization of Context-Free NCE Graph Languages by Monadic Second-Order Logic on Trees , 1990, Graph-Grammars and Their Application to Computer Science.

[40]  Irène Guessarian,et al.  Pushdown tree automata , 1983, Mathematical systems theory.