Advertisement

On the equivalence of two-way pushdown automata and counter machines over bounded languages

  • Oscar H. Ibarra
  • Tao Jiang
  • Nicholas Tran
  • Hui Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 665)

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 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.

Keywords

Turn Point Counter Machine Pushdown Automaton Input Segment Finite Control 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Chr84]
    M. Chrobak. A note on bounded-reversal multipushdown machines. Info. Proc. Letters, 19:179–180, 1984.Google Scholar
  2. [DG82]
    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.Google Scholar
  3. [GI79]
    E. M. Gurari and O. H. Ibarra. Simple counter machines and number-theoretic problems. J. Comput. System Sci., 19:145–162, 1979.Google Scholar
  4. [GI82]
    E. M. Gurari and O. H. Ibarra. Two-way counter machines and diophantine equations. J. Assoc. Comput. Mach., 29:863–873, 1982.Google Scholar
  5. [Iba78]
    O. H. Ibarra. Reversal-bounded multicounter machines and their decision problems. J. Assoc. Comput. Mach., 25:116–133, 1978.Google Scholar
  6. [IJ91]
    O. Ibarra and T. Jiang. The power of alternating one-reversal counters and stacks. SIAM Journal on Computing, 20(2):278–290, 1991.Google Scholar
  7. [Min61]
    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.Google Scholar
  8. [Mon84]
    B. Monien. Deterministic two-way one-head pushdown automata are very powerful. Info. Proc. Letters, 18:239–242, 1984.Google Scholar
  9. [Val74]
    L. Valiant. The equivalence problem for deterministic finite-turn pushdown automata. Inform. and Contr., 25:123–133, 1974.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Oscar H. Ibarra
    • 1
  • Tao Jiang
    • 2
  • Nicholas Tran
    • 1
  • Hui Wang
    • 3
  1. 1.Department of Computer ScienceUniversity of CaliforniaSanta Barbara
  2. 2.Department of Computer Science and SystemsMcMaster UniversityHamiltonCanada
  3. 3.Department of Computer ScienceUniversity of Alabama in Huntsville

Personalised recommendations