On Multi-Head Finite Automata
From MaRDI portal
Publication:5553286
Cited in
(46)- Tradeoffs for language recognition on alternating machines
- Finite dP Automata versus Multi-head Finite Automata
- Stack versus sensitivity for one-way automata
- Alternation in simple devices
- One-way reversible multi-head finite automata
- Logarithmic space and permutations
- On the Computational Capacity of Parallel Communicating Finite Automata
- k\(+1\) heads are better than k for PDAs
- Stateless one-way multi-head finite automata with pebbles
- Exact affine counter automata
- One-reversal counter machines and multihead automata: revisited
- One-reversal counter machines and multihead automata: revisited
- Exact Affine Counter Automata
- A new complete language for DSPACE(log n)
- On multi-head automata with restricted nondeterminism
- One way multihead deterministic finite automata
- Algebraic languages and polyominoes enumeration
- On Stateless Multihead Finite Automata and Multihead Pushdown Automata
- Tight hierarchy of data-independent multi-head automata
- 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
- Deterministic versus nondeterministic space in terms of synchronized alternating machines
- Possibilities of various types of alternating automata
- On tape-bounded complexity classes and multihead finite automata
- Reversible parallel communicating finite automata systems
- scientific article; zbMATH DE number 3443638 (Why is no real title available?)
- Jump complexity of finite automata with translucent letters
- Head and state hierarchies for unary multi-head finite automata
- On 3-head versus 2-head finite automata
- A useful device for showing the solvability of some decision problems
- On the power of two-way multihead quantum finite automata
- One-way simple multihead finite automata
- One-way multihead finite automata and 2-bounded languages
- Three write heads are as good ask
- On stateless multihead automata: hierarchies and the emptiness problem
- Characterizingco-NLby a group action
- Remarks on sorting and one-way multihead finite automata
- Hierarchies of one-way multihead automata languages
- Linear automata with translucent letters and linear context-free trace languages
- Remarks on multihead pushdown automata and multihead stack automata
- Multihead one-way finite automata
- On the descriptional complexity of Watson-Crick automata
- One-way reversible multi-head finite 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)
