One-way simple multihead finite automata
From MaRDI portal
Publication:1258608
DOI10.1016/0304-3975(79)90033-1zbMath0408.68050OpenAlexW1972068940MaRDI QIDQ1258608
Publication date: 1979
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(79)90033-1
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Hierarchies of one-way multihead automata languages ⋮ Multiprocessor automata ⋮ Tradeoffs for language recognition on alternating machines ⋮ Sensing versus nonsensing automata ⋮ A NOTE ON REBOUND TURING MACHINES ⋮ Some classes of languages in \(NC^ 1\) ⋮ One-way simple multihead finite automata are not closed under concatenation ⋮ Alternating simple multihead finite automata
Cites Work
- Unnamed Item
- Unnamed Item
- On 3-head versus 2-head finite automata
- A note on semilinear sets and bounded-reversal multihead pushdown automata
- On tape-bounded complexity classes and multihead finite automata
- Remarks on the complexity of nondeterministic counter languages
- A useful device for showing the solvability of some decision problems
- Finite automata with multiplication
- The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors
- Erasable context-free languages
- One-way multihead writing finite automata
- Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages
- k + 1 Heads Are Better than k
- Counter machines and counter languages
- On Multi-Head Finite Automata
- Multi-tape and multi-head pushdown automata
This page was built for publication: One-way simple multihead finite automata
