Abstract
It is known that two-way pushdown automata ate more powerful than two-way counter machines. The result is also true for the case when the pushdown store and counter are reversal-bounded. In contrast, we show that two-way reversal-bounded pushdown automata over bounded languages (i.e., subsets of w *1 ... w * k for some nonnull words w 1 ..., wk) are equivalent to two-way reversal-bounded counter machines. We also show that, unlike the unbounded input case, two-way reversal-bounded pushdown automata over bounded languages have decidable emptiness, equivalence and containment problems.
Research supported in part by NSF Grant CCR89-18409.
Research supported in part by NSERC Operating Grant OGP 0046613.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Chrobak. A note on bounded-reversal multipushdown machines. Info. Proc. Letters, 19:179–180, 1984.
P. Duris and Z. Galil. Fooling a two way automaton or one pushdown store is better than one counter for two way machines. Theoretical Computer Science, 21:39–53, 1982.
E. M. Gurari and O. H. Ibarra. Simple counter machines and number-theoretic problems. J. Comput. System Sci., 19:145–162, 1979.
E. M. Gurari and O. H. Ibarra. Two-way counter machines and diophantine equations. J. Assoc. Comput. Mach., 29:863–873, 1982.
O. H. Ibarra. Reversal-bounded multicounter machines and their decision problems. J. Assoc. Comput. Mach., 25:116–133, 1978.
O. Ibarra and T. Jiang. The power of alternating one-reversal counters and stacks. SIAM Journal on Computing, 20(2):278–290, 1991.
M. Minsky. Recursive unsolvability of Post's problem of tag and other topics in the theory of Turing machines. Ann. of Math., 74:437–455, 1961.
B. Monien. Deterministic two-way one-head pushdown automata are very powerful. Info. Proc. Letters, 18:239–242, 1984.
L. Valiant. The equivalence problem for deterministic finite-turn pushdown automata. Inform. and Contr., 25:123–133, 1974.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ibarra, O.H., Jiang, T., Tran, N., Wang, H. (1993). On the equivalence of two-way pushdown automata and counter machines over bounded languages. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds) STACS 93. STACS 1993. Lecture Notes in Computer Science, vol 665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_36
Download citation
DOI: https://doi.org/10.1007/3-540-56503-5_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56503-1
Online ISBN: 978-3-540-47574-3
eBook Packages: Springer Book Archive