论文信息 - Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata

Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata

Several classes of multihead and auxiliary stack automata are introduced and are used to characterize some tape and time complexity classes of Turing machines.

Oscar H. Ibarra | O. Ibarra

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

[2] J. Hopcroft,et al. An Approach to a Unified Theory of Automata , 1967, SWAT.

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

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

[5] Richard Edwin Stearns,et al. Hierarchies of memory limited computations , 1965, SWCT.

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

[7] Jeffrey D. Ullman. Halting Stack Automata , 1969, JACM.

[8] Michael J. Fischer. Two Characterizations of the Context-Sensitive Languages , 1969, SWAT.

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

[10] Richard Edwin Stearns,et al. Two-Tape Simulation of Multitape Turing Machines , 1966, JACM.

[11] Joseph Alphonso Giuliano. Writing Stack Acceptors , 1970, SWAT.

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