On relativizing auxiliary pushdown machines
- 1 December 1979
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 13 (1) , 283-299
- https://doi.org/10.1007/bf01744301
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Deterministic CFL's are accepted simultaneously in polynomial time and log squared spacePublished by Association for Computing Machinery (ACM) ,1979
- Log space machines with multiple oracle tapesTheoretical Computer Science, 1978
- On the Tape Complexity of Deterministic Context-Free LanguagesJournal of the ACM, 1978
- Relativization of questions about log space computabilityTheory of Computing Systems, 1976
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971