Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

A class of machines called auxiliary pushdown machines is introduced. Several types of pushdown automata, including stack automata, are characterized in terms of these machines. The computing power of each class of machines in question is characterized in terms of time-bounded Turing machines, and corollaries are derived which answer some open questions in the field. ~

[1]  Journal of the Association for Computing Machinery , 1961, Nature.

[2]  John C. Shepherdson,et al.  Computability of Recursive Functions , 1963, JACM.

[3]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

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

[5]  Donald E. Knuth,et al.  Programming Language for Automata , 1967, JACM.

[6]  Oscar H. Ibarra,et al.  Two-Way Pushdown Automata , 1967, Inf. Control..

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

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

[9]  Oscar H. Ibarra,et al.  Multi-Tape and Multi-Head Pushdown Automata , 1968, Inf. Control..

[10]  Maurice V. Wilkes,et al.  Computers Then and Now , 1968, JACM.

[11]  Alfred V. Aho,et al.  Time and Tape Complexity of Pushdown Automaton Languages , 1968, Inf. Control..

[12]  Stephen N. Cole.  Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines , 1969, IEEE Transactions on Computers.

[13]  Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines , 1969, IEEE Trans. Computers.

[14]  Stephen A. Cook,et al.  Review: Alan Cobham, Yehoshua Bar-Hillel, The Intrinsic Computational Difficulty of Functions , 1969 .

[15]  George Mager,et al.  Writing Pushdown Acceptors , 1969, J. Comput. Syst. Sci..

[16]  Stephen A. Cook,et al.  Variations on pushdown machines (Detailed Abstract) , 1969, STOC.