Abstract
It is known that two-way pushdown automata are 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 w1,…, 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.
Cite
CITATION STYLE
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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 665 LNCS, pp. 354–364). Springer Verlag. https://doi.org/10.1007/3-540-56503-5_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
