Alphabetic Pushdown Tree Transducers

We introduce the concept of an alphabetic pushdown tree transducer, by adding a stack to an alphabetic tree transducer in the same way as a pushdown tree automaton is obtained from a top-down tree automaton. The stack of the general model contains trees, however, we also consider a restricted model of which the stack contains only unary trees. We give a characterization of the tree transformation induced by a restricted alphabetic pushdown tree transducer in terms of an algebraic forest over a suitable ranked alphabet and a bimorphism.We compare the class of tree relations induced by the alphabetic pushdown tree transducers with known classes of tree transformations. Finally, a new hierarchy of tree relations is established.

[1]  George Rahonis,et al.  On the Size of Stack and Synchronization Alphabets of Tree Automata , 1998, Fundam. Informaticae.

[2]  Joost Engelfriet,et al.  Top-down tree transducers with regular look-ahead , 1975, Mathematical systems theory.

[3]  Zoltán Fülöp,et al.  Syntax-Directed Semantics , 1998, Monographs in Theoretical Computer Science An EATCS Series.

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

[5]  Katsunori Yamasaki.  Fundamental Properties of Pushdown Tree Transducer (PDTT) A Top-Down Case , 1993 .

[6]  Sándor Vágvölgyi,et al.  Iterated Deterministic Top-Down Look-Ahead , 1989, FCT.

[7]  George Rahonis,et al.  Alphabetic and synchronized tree transducers , 2001, Theor. Comput. Sci..

[8]  Sándor Vágvölgyi,et al.  Variants of top-down tree transducers with look-ahead , 2005, Mathematical systems theory.

[9]  Katsunori Yamasaki.  Note on Domain/Surface Tree Languages of t-PDTT's , 1996 .

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

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

[12]  George Rahonis,et al.  On two families of forests , 1994, Acta Informatica.

[13]  Alfred V. Aho,et al.  The Theory of Parsing, Translation, and Compiling , 1972 .

[14]  Symeon Bozapalidis.  Alphabetic Tree Relations , 1992, Theor. Comput. Sci..

[15]  Christian Choffrut,et al.  Properties of Finite and Pushdown Transducers , 1983, SIAM J. Comput..

[16]  Sándor Vágvölgyi,et al.  Top-Down Tree Transducers with Deterministic Top-Down Look-Ahead , 1989, Inf. Process. Lett..

[17]  Kai Salomaa,et al.  Synchronized Tree Automata , 1994, Theor. Comput. Sci..