Pages that link to "Item:Q2542726"
From MaRDI portal
The following pages link to Time- and tape-bounded Turing acceptors and AFLs (Q2542726):
Displayed 22 items.
- Simulating two pushdown stores by one tape in \(O(n^{1.5}\,\sqrt{\log \,n})\) time (Q1113670) (← links)
- On alternation (Q1141480) (← links)
- Bounded query machines: on NP and PSPACE (Q1158751) (← links)
- Comparing complexity classes (Q1227731) (← links)
- Degree-languages: A new concept of acceptance (Q1236888) (← links)
- Complete sets and the polynomial-time hierarchy (Q1241440) (← links)
- A note on classes of complements and the LBA-problem (Q1243140) (← links)
- Classes of formal grammars (Q1248342) (← links)
- Computational complexity of multitape Turing machines and random access machines (Q1249434) (← links)
- On languages specified by relative acceptance (Q1249438) (← links)
- Almost-everywhere complexity hierarchies for nondeterministic time (Q1261465) (← links)
- Tape-bounded Turing acceptors and principal AFLs (Q2542727) (← links)
- Time-bounded grammars and their languages (Q2548174) (← links)
- (Q3657451) (← links)
- Combinatorial Lower Bound Arguments for Deterministic and Nondeterministic Turing Machines (Q3748273) (← links)
- Characterizations of reduction classes modulo oracle conditions (Q3763590) (← links)
- (Q4131691) (← links)
- Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem (Q4354236) (← links)
- Alternating time versus deterministic time: A separation (Q4717057) (← links)
- Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences (Q5200101) (← links)
- A model for ergodic automorphisms on groups (Q5650907) (← links)
- Time-space tradeoffs for SAT on nonuniform machines (Q5956015) (← links)