On languages specified by relative acceptance
From MaRDI portal
Cites work
- A comparison of polynomial time reducibilities
- A second step toward the polynomial hierarchy
- Augmented loop languages and classes of computable functions
- Comparing language operations
- Complete sets and the polynomial-time hierarchy
- Control sets on context-free grammar forms
- scientific article; zbMATH DE number 3483582 (Why is no real title available?)
- scientific article; zbMATH DE number 3083488 (Why is no real title available?)
- Linear Languages and the Intersection Closures of Classes of Languages
- On the Structure of Polynomial Time Reducibility
- One way finite visit automata
- Relativization of questions about log space computability
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Rudimentary Predicates and Relative Computation
- Simple Representations of Certain Classes of Languages
- Space-bounded reducibility among combinatorial problems
- The complexity of the membership problem for some extensions of context-free languagest†
- The lattices of prefixes and overlaps of traces
- The polynomial-time hierarchy
- Time- and tape-bounded Turing acceptors and AFLs
Cited in
(7)- Representations of language families by homomorphic equality operations and generalized equality sets
- Reset machines
- Bounded query machines: on NP and PSPACE
- scientific article; zbMATH DE number 3872715 (Why is no real title available?)
- Characterizations of reduction classes modulo oracle conditions
- scientific article; zbMATH DE number 3602690 (Why is no real title available?)
- scientific article; zbMATH DE number 3604381 (Why is no real title available?)
This page was built for publication: On languages specified by relative acceptance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1249438)
