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.
Cite
CITATION STYLE
Gurari, E. M., & Ibarra, O. H. (1981). The complexity of decision problems for finite-turn multicounter machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 115 LNCS, pp. 495–505). Springer Verlag. https://doi.org/10.1007/3-540-10843-2_39
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
