The following pages link to On Multi-Head Finite Automata (Q5553286):
Displayed 46 items.
- Logarithmic space and permutations (Q276248) (← links)
- On multi-head automata with restricted nondeterminism (Q436607) (← links)
- Head and state hierarchies for unary multi-head finite automata (Q478518) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- Stack versus sensitivity for one-way automata (Q688153) (← links)
- One-reversal counter machines and multihead automata: revisited (Q714812) (← 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)
- Hierarchies of one-way multihead automata languages (Q1099645) (← links)
- k\(+1\) heads are better than k for PDAs (Q1109579) (← links)
- Tradeoffs for language recognition on alternating machines (Q1117697) (← links)
- A new complete language for DSPACE(log n) (Q1123607) (← links)
- Multihead one-way finite automata (Q1183574) (← links)
- On 3-head versus 2-head finite automata (Q1211473) (← links)
- On tape-bounded complexity classes and multihead finite automata (Q1215271) (← links)
- A useful device for showing the solvability of some decision problems (Q1230657) (← links)
- One-way simple multihead finite automata (Q1258608) (← 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)
- Reversible parallel communicating finite automata systems (Q2041681) (← links)
- Real-time, constant-space, constant-randomness verifiers (Q2164756) (← links)
- Tight hierarchy of data-independent multi-head automata (Q2194865) (← links)
- On the descriptional complexity of Watson-Crick automata (Q2271460) (← links)
- One-way reversible multi-head finite automata (Q2358688) (← links)
- Finite dP Automata versus Multi-head Finite Automata (Q2890286) (← links)
- UNDECIDABILITY AND HIERARCHY RESULTS FOR PARALLEL COMMUNICATING FINITE AUTOMATA (Q2909096) (← links)
- ON THE COMPUTATIONAL CAPACITY OF PARALLEL COMMUNICATING FINITE AUTOMATA (Q2909225) (← links)
- One-Reversal Counter Machines and Multihead Automata: Revisited (Q3075514) (← links)
- Linear automata with translucent letters and linear context-free trace languages (Q3298123) (← links)
- One-Way Reversible Multi-head Finite Automata (Q3453731) (← links)
- On the Computational Capacity of Parallel Communicating Finite Automata (Q3533006) (← links)
- On Stateless Multihead Finite Automata and Multihead Pushdown Automata (Q3637229) (← links)
- Possibilities of various types of alternating automata (Q3787476) (← links)
- Three write heads are as good ask (Q3878760) (← links)
- Alternation in simple devices (Q4645188) (← links)
- (Q4769049) (← links)
- (Q5016371) (← links)
- On the power of two-way multihead quantum finite automata (Q5223828) (← links)
- STATELESS ONE-WAY MULTI-HEAD FINITE AUTOMATA WITH PEBBLES (Q5247180) (← links)
- Characterizing<b>co-NL</b>by a group action (Q5741572) (← links)
- One-way multihead finite automata and 2-bounded languages (Q5750399) (← links)
- Real-time, constant-space, constant-randomness verifiers (Q6077068) (← links)
- Exact Affine Counter Automata (Q6114873) (← links)
- Jump complexity of finite automata with translucent letters (Q6190004) (← links)