One-way multihead writing finite automata
From MaRDI portal
Publication:4103516
DOI10.1016/S0019-9958(76)90426-5zbMath0337.02023OpenAlexW2146848591MaRDI QIDQ4103516
Publication date: 1976
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(76)90426-5
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Related Items
One-way reversible multi-head finite automata ⋮ Hierarchies of one-way multihead automata languages ⋮ k\(+1\) heads are better than k for PDAs ⋮ Tradeoffs for language recognition on alternating machines ⋮ Queue Automata: Foundations and Developments ⋮ Multihead one-way finite automata ⋮ QRT FIFO automata, breadth-first grammars and their relations ⋮ Stack versus sensitivity for one-way automata ⋮ Self-Verifying Pushdown and Queue Automata ⋮ On tape-bounded complexity classes and multihead finite automata ⋮ Three write heads are as good ask ⋮ One-way simple multihead finite automata ⋮ One way multihead deterministic finite automata ⋮ STATELESS ONE-WAY MULTI-HEAD FINITE AUTOMATA WITH PEBBLES ⋮ Remarks on multihead pushdown automata and multihead stack automata ⋮ Alternating simple multihead finite automata ⋮ Unnamed Item
