On Multi-Head Finite Automata

Cited In (46)

Finite dP Automata versus Multi-head Finite Automata
Tradeoffs for language recognition on alternating machines
Stack versus sensitivity for one-way automata
Alternation in simple devices
One-way reversible multi-head finite automata
On the Computational Capacity of Parallel Communicating Finite Automata
Logarithmic space and permutations
k\(+1\) heads are better than k for PDAs
Stateless one-way multi-head finite automata with pebbles
Exact affine counter automata
Exact Affine Counter Automata
One-reversal counter machines and multihead automata: revisited
One-reversal counter machines and multihead automata: revisited
A new complete language for DSPACE(log n)
On Stateless Multihead Finite Automata and Multihead Pushdown Automata
One way multihead deterministic finite automata
Tight hierarchy of data-independent multi-head automata
Algebraic languages and polyominoes enumeration
On multi-head automata with restricted nondeterminism
Complexity of multi-head finite automata: origins and directions
On the computational capacity of parallel communicating finite automata
Undecidability and hierarchy results for parallel communicating finite automata
Possibilities of various types of alternating automata
Deterministic versus nondeterministic space in terms of synchronized alternating machines
On tape-bounded complexity classes and multihead finite automata
Title not available (Why is that?)
Jump complexity of finite automata with translucent letters
Reversible parallel communicating finite automata systems
Head and state hierarchies for unary multi-head finite automata
On 3-head versus 2-head finite automata
On the power of two-way multihead quantum finite automata
A useful device for showing the solvability of some decision problems
One-way multihead finite automata and 2-bounded languages
Three write heads are as good ask
One-way simple multihead finite automata
On stateless multihead automata: hierarchies and the emptiness problem
Characterizingco-NLby a group action
Linear automata with translucent letters and linear context-free trace languages
Remarks on sorting and one-way multihead finite automata
Hierarchies of one-way multihead automata languages
Remarks on multihead pushdown automata and multihead stack automata
Multihead one-way finite automata
One-way reversible multi-head finite automata
On the descriptional complexity of Watson-Crick automata
Real-time, constant-space, constant-randomness verifiers
Real-time, constant-space, constant-randomness verifiers

This page was built for publication: On Multi-Head Finite Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5553286)