Reversal-Bounded Multicounter Machines and Their Decision Problems

Abstract

Decidable and undecldable properties of various classes of two-way multlcounter machines (deterministic, nondetermmlstlc, multttape, pushdown store augmented) with reversal-bounded input and/or counters are investigated In particular It IS shown that the emptiness, infiniteness, dlsjointness, containment, universe, and equivalence problems are decidable for the class of deterministic two-way multlcounter machines whose input and counters are reversal-bounded. © 1978, ACM. All rights reserved.