Multi-head finite automata: characterizations, concepts and open problems
From MaRDI portal
Publication:5145152
zbMATH Open1456.68089arXiv0906.3051MaRDI QIDQ5145152FDOQ5145152
Authors: Markus Holzer, Martin Kutrib, Andreas Malcher
Publication date: 20 January 2021
Full work available at URL: https://arxiv.org/abs/0906.3051
Recommendations
Cited In (13)
- Finite dP Automata versus Multi-head Finite Automata
- A NOTE ON MULTIHEAD FINITE-STATE AUTOMATA
- Logarithmic space and permutations
- Some characterizations of multihead finite automata
- Plane-Walking Automata
- Complexity of multi-head finite automata: origins and directions
- Title not available (Why is that?)
- Alternating multihead finite automata
- Title not available (Why is that?)
- Multi-head finite automata: Data-independent versus data-dependent computations
- Multihead one-way finite automata
- On computational power of partially blind automata
- On partially blind multihead finite automata.
This page was built for publication: Multi-head finite automata: characterizations, concepts and open problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145152)