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