Basic Tree Transducers

Abstract The concept of basic tree transducer is investigated; it is obtained as a natural restriction of the concept of macro tree transducer by forbidding nesting of states. Basic tree transducers are characterized in terms of one-turn pushdown machines. A close connection between path languages of ranges of (compositions of) basic tree transducers and (iterated) control on linear grammars is established. This connection allows to prove the strictness of the composition hierarchy of basic tree transducers.

[1]  Joost Engelfriet,et al.  Extended Macro Grammars and Stack Controlled Machines , 1984, J. Comput. Syst. Sci..

[2]  Jan van Leeuwen,et al.  Notes on Pre-Set Pushdown Automata , 1974, L Systems.

[3]  J. Engelfriet,et al.  IO and OI , 1975 .

[4]  Joost Engelfriet,et al.  Look-Ahead on Pushdowns , 1987, Inf. Comput..

[5]  Joost Engelfriet,et al.  Iterated pushdown automata and complexity classes , 1983, STOC.

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

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

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

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

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

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

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

[13]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[14]  Rainer Parchmann,et al.  Linear Indexed Languages , 1984, Theor. Comput. Sci..

[15]  Werner Damm,et al.  The IO- and OI-Hierarchies , 1982, Theor. Comput. Sci..

[16]  S. Ginsburg,et al.  Finite-Turn Pushdown Automata , 1966 .

[17]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[18]  Werner Damm,et al.  An Automata-Theoretical Characterization of the OI-Hierarchy , 1986, Inf. Control..

[19]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[20]  Bruno Courcelle,et al.  A Representation of Trees by Languages II , 1978, Theor. Comput. Sci..

[21]  Sheila A. Greibach.  Full AFLs and Nested Iterated Substitution , 1970, Inf. Control..

[22]  Nabil A. Khabbaz.  A Geometric Hierarchy of Languages , 1974, J. Comput. Syst. Sci..

[23]  Joost Engelfriet,et al.  IO and OI. I , 1977, J. Comput. Syst. Sci..

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

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

[26]  William C. Rounds,et al.  Tree-oriented proofs of some theorems on context-free and indexed languages , 1970, STOC.

[27]  Alfred V. Aho,et al.  Indexed Grammars—An Extension of Context-Free Grammars , 1967, SWAT.

[28]  Sheila A. Greibach,et al.  One Way Finite Visit Automata , 1978, Theor. Comput. Sci..

[29]  Nabil A. Khabbaz.  Control Sets on Linear Grammars , 1974, Inf. Control..

[30]  Joost Engelfriet,et al.  Characterization of High Level Tree Transducers , 1985, ICALP.

[31]  Sheila A. Greibach,et al.  Control Sets of Context-Free Grammar Forms , 1977, J. Comput. Syst. Sci..

[32]  Alfred V. Aho,et al.  Nested Stack Automata , 1969, Journal of the ACM.

[33]  Grzegorz Rozenberg,et al.  The mathematical theory of L systems , 1980 .

[34]  Heiko Vogler.  The OI-Hierarchy Is Closed under Control , 1988, Inf. Comput..

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

[36]  Joost Engelfriet,et al.  Bounded Nesting in Macro Grammars , 1979, Inf. Control..

[37]  Sheila A. Greibach,et al.  Checking Automata and One-Way Stack Languages , 1969, J. Comput. Syst. Sci..

[38]  Bruno Courcelle,et al.  On the Equivalence Problem for Attribute Systems , 1982, Inf. Control..