Bounded-reversal multihead finite automata languages
From MaRDI portal
Publication:4768638
DOI10.1016/S0019-9958(74)90994-2zbMath0282.68033OpenAlexW2158448273MaRDI QIDQ4768638
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
Related Items
Tradeoffs for language recognition on alternating machines, Complexity of multi-head finite automata: origins and directions, Tight hierarchy of data-independent multi-head automata, Two-way deterministic multi-weak-counter machines, Head and state hierarchies for unary multi-head finite automata, SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA, Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages, On tape-bounded complexity classes and multihead finite automata, Investigations on Automata and Languages Over a Unary Alphabet, A useful device for showing the solvability of some decision problems, Finite automata with multiplication, Unnamed Item, On the power of two-way multihead quantum finite automata, Descriptional complexity of regular languages