Pages that link to "Item:Q1215271"
From MaRDI portal
The following pages link to On tape-bounded complexity classes and multihead finite automata (Q1215271):
Displayed 32 items.
- On multi-head automata with restricted nondeterminism (Q436607) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- Knapsack problems for NL (Q673615) (← links)
- Multihead two-way probabilistic finite automata (Q675857) (← links)
- First-order logics: some characterizations and closure properties (Q715044) (← links)
- Some classes of languages in \(NC^ 1\) (Q756426) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- Bandwidth constraints on problems complete for polynomial time (Q791316) (← links)
- The complexity of regular DNLC graph languages (Q909473) (← links)
- Alternating simple multihead finite automata (Q1058853) (← links)
- Alternating on-line Turing machines with only universal states and small space bounds (Q1083207) (← links)
- On nondeterminism in parallel computation (Q1099612) (← links)
- k\(+1\) heads are better than k for PDAs (Q1109579) (← links)
- Alternating multihead finite automata (Q1116353) (← links)
- Three-dimensional alternating Turing machines with only universal states (Q1129412) (← links)
- Two-way deterministic multi-weak-counter machines (Q1165028) (← links)
- Multihead one-way finite automata (Q1183574) (← links)
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems (Q1185244) (← links)
- Communication for alternating machines (Q1203600) (← links)
- Space-bounded reducibility among combinatorial problems (Q1221749) (← links)
- Bracket-languages are recognizable in logarithmic space (Q1235984) (← links)
- The LBA-problem and the deterministic tape complexity of two-way one- counter languages over a one-letter alphabet (Q1239007) (← links)
- Stack languages and log n space (Q1250712) (← links)
- One-way simple multihead finite automata (Q1258608) (← links)
- Properties of probabilistic pushdown automata (Q1274989) (← links)
- On the parallel complexity of loops (Q1391751) (← links)
- Multi-head finite automata: Data-independent versus data-dependent computations (Q1608894) (← links)
- Boundedness, empty channel detection, and synchronization for communicating finite automata (Q1819939) (← links)
- Relativization of questions about log space computability (Q4109299) (← links)
- Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages (Q4128015) (← links)
- (Q4146255) (← links)
- On deciding some equivalences for concurrent processes (Q4362275) (← links)