On relativizing auxiliary pushdown machines
From MaRDI portal
Publication:3862402
DOI10.1007/BF01744301zbMath0426.68023MaRDI QIDQ3862402
Publication date: 1980
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01744301
oracle Turing machines; auxiliary pushdown machines; computational complexity classes relative to oracle sets
68Q25: Analysis of algorithms and problem complexity
Related Items
Properties of probabilistic pushdown automata, Consistency in nondeterministic storage, Space-bounded hierarchies and probabilistic computations, Relativized alternation and space-bounded computation, A measure of relativized space which is faithful with respect to depth, A survey of space complexity, Properties of probabilistic pushdown automata
Cites Work
- Bounded query machines: on NP and PSPACE
- Bounded query machines: on NP( ) and NPQUERY( )
- Log space machines with multiple oracle tapes
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Relativization of questions about log space computability
- On the Tape Complexity of Deterministic Context-Free Languages
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers