Pages that link to "Item:Q4148951"
From MaRDI portal
The following pages link to <i>k</i> + 1 Heads Are Better than <i>k</i> (Q4148951):
Displaying 42 items.
- Head and state hierarchies for unary multi-head finite automata (Q478518) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- Multihead two-way probabilistic finite automata (Q675857) (← links)
- Stack versus sensitivity for one-way automata (Q688153) (← links)
- On the power of real-time two-way multihead finite automata with jumps (Q794171) (← links)
- Deterministic two-way one-head pushdown automata are very powerful (Q800088) (← links)
- Separation of deterministic, nondeterministic and alternating complexity classes (Q809596) (← links)
- On the power of synchronization in parallel computations (Q811118) (← links)
- On stateless multihead automata: hierarchies and the emptiness problem (Q844888) (← links)
- Remarks on sorting and one-way multihead finite automata (Q917328) (← links)
- Remarks on multihead pushdown automata and multihead stack automata (Q1052822) (← links)
- On the power of alternation in automata theory (Q1068537) (← links)
- String-matching cannot be done by a two-head one-way deterministic finite automaton (Q1075776) (← links)
- Hierarchies of one-way multihead automata languages (Q1099645) (← links)
- Alternating multihead finite automata (Q1116353) (← links)
- Tradeoffs for language recognition on alternating machines (Q1117697) (← links)
- A new complete language for DSPACE(log n) (Q1123607) (← links)
- Fooling a two way automaton or one pushdown store is better than one counter for two way machines (Q1165027) (← links)
- Multihead one-way finite automata (Q1183574) (← links)
- QRT FIFO automata, breadth-first grammars and their relations (Q1183576) (← links)
- On space-bounded synchronized alternating Turing machines (Q1193901) (← links)
- One-way simple multihead finite automata (Q1258608) (← links)
- Synchronized finite automata and 2DFA reductions (Q1261467) (← links)
- Deterministic versus nondeterministic space in terms of synchronized alternating machines (Q1334670) (← links)
- Algebraic languages and polyominoes enumeration (Q1348529) (← links)
- One way multihead deterministic finite automata (Q1836312) (← links)
- Watson-Crick quantum finite automata (Q2035008) (← links)
- Real-time, constant-space, constant-randomness verifiers (Q2164756) (← links)
- Tight hierarchy of data-independent multi-head automata (Q2194865) (← links)
- One-way reversible multi-head finite automata (Q2358688) (← links)
- Reversible Watson-Crick automata (Q2406432) (← links)
- On store languages and applications (Q2417850) (← links)
- Set Automata (Q2814837) (← links)
- On Computational Power of Partially Blind Automata (Q2867275) (← links)
- UNDECIDABILITY AND HIERARCHY RESULTS FOR PARALLEL COMMUNICATING FINITE AUTOMATA (Q2909096) (← links)
- ON THE COMPUTATIONAL CAPACITY OF PARALLEL COMMUNICATING FINITE AUTOMATA (Q2909225) (← links)
- PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES (Q3021983) (← links)
- The complexity of ranking simple languages (Q3034844) (← links)
- One-Reversal Counter Machines and Multihead Automata: Revisited (Q3075514) (← links)
- From Nondeterministic to Multi-Head Deterministic Finite-State Transducers (Q5092329) (← links)
- Real-time, constant-space, constant-randomness verifiers (Q6077068) (← links)
- Independent finite automata on Cayley graphs (Q6191205) (← links)
