Writing stack acceptors
- 30 April 1972
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 6 (2) , 168-204
- https://doi.org/10.1016/s0022-0000(72)80021-7
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Principal AFLJournal of Computer and System Sciences, 1970
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- Writing pushdown acceptorsJournal of Computer and System Sciences, 1969
- Relations Between Time and Tape ComplexitiesJournal of the ACM, 1968
- Two-way pushdown automataInformation and Control, 1967
- Stack automata and compilingJournal of the ACM, 1967
- Two-Tape Simulation of Multitape Turing MachinesJournal of the ACM, 1966
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965
- Real-Time Computation and Recursive Functions Not Real-Time ComputableIEEE Transactions on Electronic Computers, 1962