Bounded-reversal multihead finite automata languages
From MaRDI portal
Publication:4768638
DOI10.1016/S0019-9958(74)90994-2zbMATH Open0282.68033OpenAlexW2158448273MaRDI QIDQ4768638FDOQ4768638
Authors: I. H. Sudborough 
Publication date: 1974
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(74)90994-2
Cited In (14)
- Tradeoffs for language recognition on alternating machines
- Title not available (Why is that?)
- Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages
- Tight hierarchy of data-independent multi-head automata
- Complexity of multi-head finite automata: origins and directions
- On tape-bounded complexity classes and multihead finite automata
- Investigations on automata and languages over a unary alphabet
- Head and state hierarchies for unary multi-head finite automata
- On the power of two-way multihead quantum finite automata
- A useful device for showing the solvability of some decision problems
- Descriptional complexity of regular languages
- Finite automata with multiplication
- Simulations of unary one-way multi-head finite automata
- Two-way deterministic multi-weak-counter machines
This page was built for publication: Bounded-reversal multihead finite automata languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4768638)
