The following pages link to (Q3707408):
Displayed 26 items.
- Weak and strong one-way space complexity classes (Q293473) (← links)
- Knapsack problems for NL (Q673615) (← links)
- Linear speed-up does not hold on Turing machines with tree storages (Q688445) (← links)
- A linear-time simulation of deterministic \(d\)-limited automata (Q832958) (← links)
- A result relating disjunctive self-reducibility to P-immunity (Q915447) (← links)
- Space measures for storage modification machines (Q1119021) (← links)
- Notes on looping deterministic two-way pushdown automata (Q1318758) (← links)
- Refined simulation of multihead automata (Q1339383) (← links)
- On universally easy classes for NP-complete problems. (Q1401418) (← links)
- Prediction of infinite words with automata (Q1635815) (← links)
- Reversible parallel communicating finite automata systems (Q2041681) (← links)
- Converting nondeterministic two-way automata into small deterministic linear-time machines (Q2105419) (← links)
- Searching for applicable versions of computable structures (Q2117745) (← links)
- Performing regular operations with 1-limited automata (Q2164004) (← links)
- (Q3349963) (← links)
- On the Computational Capacity of Parallel Communicating Finite Automata (Q3533006) (← links)
- Uniform simulations of nondeterministic real time multitape turing machines (Q3771615) (← links)
- A time-space hierarchy between polynomial time and polynomial space (Q4000863) (← links)
- Deterministic Stack Transducers (Q4605515) (← links)
- Alternation in simple devices (Q4645188) (← links)
- Reversals and alternation (Q5096156) (← links)
- On weak growing context-sensitive grammars (Q5096331) (← links)
- The emptiness problem for intersections of regular languages (Q5096847) (← links)
- On the decidability of finding a positive ILP-instance in a regular set of ILP-instances (Q5918790) (← links)
- Computation models and function algebras (Q6064278) (← links)
- Two-way machines and de Bruijn words (Q6199880) (← links)