Some characterizations of multihead finite automata
From MaRDI portal
Recommendations
- Multi-head finite automata: characterizations, concepts and open problems
- A NOTE ON MULTIHEAD FINITE-STATE AUTOMATA
- scientific article; zbMATH DE number 3383997
- Complexity of multi-head finite automata: origins and directions
- Alternating multihead finite automata
- On multi-head automata with restricted nondeterminism
- Multihead one-way finite automata
- On Stateless Multihead Finite Automata and Multihead Pushdown Automata
- Finite dP Automata versus Multi-head Finite Automata
- Alternating simple multihead finite automata
Cited in
(14)- Two-way automata with more than one storage medium
- Multi-head finite automata: Data-independent versus data-dependent computations
- The power of two-way deterministic checking stack automata
- Two-head finite-state acceptors with translucent letters
- Finite dP Automata versus Multi-head Finite Automata
- A NOTE ON MULTIHEAD FINITE-STATE AUTOMATA
- On multi-head automata with restricted nondeterminism
- scientific article; zbMATH DE number 1361488 (Why is no real title available?)
- Some results concerning two-dimensional turing machines and finite automata
- The equivalence of pebbles and sensing heads for finite automata
- Multi-head finite automata: characterizations, concepts and open problems
- One-way multihead finite automata and 2-bounded languages
- Generalizations of Checking Stack Automata: Characterizations and Hierarchies
- Complexity of multi-head finite automata: origins and directions
This page was built for publication: Some characterizations of multihead finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3716303)
