Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- 1 January 1971
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 18 (1), 4-18
- https://doi.org/10.1145/321623.321625
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Writing pushdown acceptorsJournal of Computer and System Sciences, 1969
- Multi-tape and multi-head pushdown automataInformation and Control, 1968
- Time and tape complexity of pushdown automaton languagesInformation and Control, 1968
- Nonerasing stack automataJournal of Computer and System Sciences, 1967
- Two-way pushdown automataInformation and Control, 1967
- Two-Tape Simulation of Multitape Turing MachinesJournal of the ACM, 1966
- Real-time computation by n-dimensional iterative arrays of finite-state machines7th Annual Symposium on Switching and Automata Theory (swat 1966), 1966
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965