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.
Work supported in part by NSF Grant MCS79-09967.
Work supported in part by NSF Grant MCS78-01736.
Chapter PDF
Similar content being viewed by others
References
Baker, B. and Book, R., Reversal-bounded multipushdown machines, J. Comptr. and Syst. Sci. 8 (1974), 315–332.
Borosh, I. and Treybig, L., Bounds on positive integral solutions of linear Diophantine equations, Proc. Amer. Math. Soc. 55 (1976), 299–304.
Chan, T., Ph.D. Thesis (Cornell University), 1980.
Fischer, P., Meyer, A., and Rosenberg, A., Counter machines and counter languages, Math. Syst. Theory 2 (1968), 265–283.
Friedman, E. and Greibach, S., A polynomial time algorithm for deciding the equivalence problem for 2-tape deterministic finite state acceptors, to appear.
Galil, Z., Hierarchies of complete problems, Acta Informatica 6 (1976), 77–88.
Garey, M. and Johnson, D., "Computers and Intractability: A Guide to the Theory of NP-Completeness", H. Freeman, San Francisco, 1978.
Greibach, S., Remarks on the complexity of nondeterministic counter languages, Theoretical Comptr. Sci. 1 (1976), 269–288.
Greibach, S., An infinite hierarchy of context-free languages, J. ACM 16 (1969), 91–106.
Gurari, E., Transducers with decidable equivalence problem, TR-CS-79-4, University of Wisconsin-Milwaukee, (1979).
Gurari, E. and Ibarra, O., An NP-Complete number-theoretic problem, J. ACM 26 (1979), 567–581.
Hopcroft, J. and Ullman, J., "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, Reading, MA, 1979.
Ibarra, O., Reversal-bounded multicounter machines and their decision problems, J. ACM 25 (1978), 116–133.
Jones, N., Space-bounded reducibility among combinatorial problems, J. Comptr. and Syst. Sci. 11 (1975), 68–85.
Minsky, M., Recursive unsolvability of Post's problem of Tag and other topics in the theory of Turing machines, Annals of Math 74 (1961), 437–455.
Valiant, L., Decision procedures for families of deterministic push-down automata, Theory of Computation-Report No. 1, University of Warwick, Coventry, Great Britain, 1973.
Valiant, L., The equivalence problem for deterministic finite-turn pushdown automata, Inform. and Contr. 25 (1974), 123–133.
Valiant, L. and Patterson, M., Deterministic one-counter automata, J. Comptr. and Syst. Sci. 10 (1975), 340–350.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gurari, E.M., Ibarra, O.H. (1981). The complexity of decision problems for finite-turn multicounter machines. In: Even, S., Kariv, O. (eds) Automata, Languages and Programming. ICALP 1981. Lecture Notes in Computer Science, vol 115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10843-2_39
Download citation
DOI: https://doi.org/10.1007/3-540-10843-2_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10843-6
Online ISBN: 978-3-540-38745-9
eBook Packages: Springer Book Archive