(Semi)alternating stack automata

New results concerning the space complexity of languages accepted by stack automata, alternating stack automata, and alternating pushdown automata are derived. Some of the results generalize previously known results.

[1]  Richard Edwin Stearns,et al.  Memory bounds for recognition of context-free and context-sensitive languages , 1965, SWCT.

[2]  Walter L. Ruzzo.  Tree-size bounded alternation(Extended Abstract) , 1979, STOC '79.

[3]  Stephen A. Cook,et al.  Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.

[4]  Jeffrey D. Ullman,et al.  Nonerasing Stack Automata , 1967, J. Comput. Syst. Sci..

[5]  Richard J. Lipton,et al.  Alternating Pushdown Automata (Preliminary Report) , 1978, FOCS.

[6]  Dexter Kozen,et al.  On parallelism in turing machines , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

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

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

[9]  Eitan M. Gurari,et al.  Path Systems: Constructions, Solutions and Applications , 1980, SIAM J. Comput..

[10]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[11]  Walter L. Ruzzo,et al.  Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..

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

[13]  Stephen A. Cook.  Path systems and language recognition , 1970, STOC '70.

[14]  Oscar H. Ibarra,et al.  Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata , 1971, J. Comput. Syst. Sci..