Variations on pushdown machines (Detailed Abstract)

Authors:
Stephen A. Cook
Affiliations:
-
Venue:
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Year:
1969

Citing 3
Cited 5

Two-Tape Simulation of Multitape Turing Machines

Journal of the ACM (JACM)
Stack automata and compiling

Journal of the ACM (JACM)
Programming Language for Automata

Journal of the ACM (JACM)

Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

Journal of the ACM (JACM)
Path systems and language recognition

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
R70-23 Multi-Tape and Multi-Head Pushdown Automata

IEEE Transactions on Computers
Time- and tape-bounded turing acceptors and AFLs

Journal of Computer and System Sciences
Writing stack acceptors

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.