One-Reversal Counter Machines and Multihead Automata: Revisited
From MaRDI portal
Publication:3075514
DOI10.1007/978-3-642-18381-2_14zbMath1298.68127OpenAlexW2153179225MaRDI QIDQ3075514
Ehsan Chiniforooshan, Shinnosuke Seki, Lila Kari, Mark Daley, Oscar H. Ibarra
Publication date: 15 February 2011
Published in: SOFSEM 2011: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.5660
Related Items
Input-Position-Restricted Models of Language Acceptors ⋮ One-reversal counter machines and multihead automata: revisited
Cites Work
- Unnamed Item
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- On stateless multihead automata: hierarchies and the emptiness problem
- On spiking neural P systems and partially blind counter machines
- String-matching cannot be done by a two-head one-way deterministic finite automaton
- A pumping lemma for deterministic context-free languages
- Reversal-bounded multipushdown machines
- Closure and decidability properties of some language classes with respect to ciliate bio-operations.
- \(L(A)=L(B)\)? A simplified decidability proof.
- Some decision problems concerning semilinearity and commutation.
- On Stateless Multicounter Machines
- On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- k + 1 Heads Are Better than k
- Hierarchies and Characterizations of Stateless Multicounter Machines
- On Multi-Head Finite Automata
