The complexity of decision problems for finite-turn multicounter machines

Abstract

We exhibit a large class of machines with polynomial time decidable containment and equivalence problems. The machines in the class accept more than the regular sets. We know of no other class (different from the finite-state acceptors) for which the containment and equivalence problems have been shown polynomially decidable. We also discuss the complexity of other decision problems.