One-reversal counter machines and multihead automata: revisited
type: Item
instance of: scholarly article
title: One-reversal counter machines and multihead automata: revisited
zbMATH Open document ID: 1247.68133
author: Ehsan Chiniforooshan
author: Mark Daley
author: Oscar H. Ibarra
author: Lila Kari
author: Shinnosuke Seki
published in: Theoretical Computer Science
publication date: 2012-10-11T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 6093032
zbMATH Keywords: reversal-bounded counter machine
zbMATH Keywords: multihead automaton
zbMATH Keywords: bounded language
zbMATH Keywords: inclusion
zbMATH Keywords: incomparability
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.04.002
OpenAlex ID: W2028475750
cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines
cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems
cites work: On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store
cites work: On Stateless Multicounter Machines
cites work: On computational complexity of graph inference from counting
cites work: Some decision problems concerning semilinearity and commutation.
cites work: Hierarchies and Characterizations of Stateless Multicounter Machines
cites work: On spiking neural P systems and partially blind counter machines
cites work: On Multi-Head Finite Automata
cites work: One-Reversal Counter Machines and Multihead Automata: Revisited
cites work: Q5740422
cites work: Reversal-bounded multipushdown machines
cites work: String-matching cannot be done by a two-head one-way deterministic finite automaton
cites work: Q5592246
cites work: A note on semilinear sets and bounded-reversal multihead pushdown automata
DOI: 10.1016/J.TCS.2012.04.002
description: scientific article; zbMATH DE number 6093032