Tree-stack automata

We introduce a new model of stack automata, the “tree-stack automata,” extending the linear stack to a tree-stack. A main subject of our investigations is to explore the relationship between tree-stack automata and stack automata. The main result of this paper is that tree-stack have the same recognition power as stack-pushdown automata, another (well-known) extension of stack automata. Therefore we obtain that the class of languages accepted by the one-way (linear) stack automata is a proper subset of the class of languages accepted by the one-way tree-stack automata and that two-way tree-stack automata have the same recognition power as two-way (linear) stack automata. As a special case of tree-stack automata we consider tree-pushdown automata. As opposed to stack automata the tree-pushdown storage does not extend the recognition power of one-way (resp. two-way) pushdown automata.

[1]  Hans Langmaack,et al.  On procedures as open subroutines. II , 1974, Acta Informatica.

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

[3]  Hans Langmaack,et al.  On correct procedure parameter transmission in higher programming languages , 1973, Acta Informatica.

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

[5]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

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

[7]  Joost Engelfriet,et al.  Iterated Stack Automata and Complexity Classes , 1991, Inf. Comput..

[8]  Wolfram-Manfred Lippe.  Über die Entscheidbarkeit der formalen Erreichbarkeit von Prozeduren bei monadischen Programmen , 1976, Fachtagung über Programmiersprachen.

[9]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

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

[11]  Catriel Beeri,et al.  Two-Way Nested Stack Automata Are Equivalent to Two-Way Stack Automata , 1975, J. Comput. Syst. Sci..

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

[13]  Seymour Ginsburg,et al.  Stack automata and compiling , 1967, JACM.

[14]  Michael A. Harrison,et al.  A Grammatical Characterization of One-Way Nondeterministic Stack Languages , 1971, JACM.

[15]  Walter S. Brainerd,et al.  Tree Generating Regular Systems , 1969, Inf. Control..

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

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

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

[19]  J. R. Büchi.  Regular Canonical Systems , 1964 .

[20]  Seymour Ginsburg,et al.  One-way stack automata , 1967, JACM.

[21]  William F. Ogden.  Intercalation theorems for stack languages , 1969, STOC '69.

[22]  Wolfram-Manfred Lippe.  Erweiterungen von Dendrogrammatiken , 1980, J. Inf. Process. Cybern..