Advertisement

On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store

  • Pavol Dūri¯s
  • Zvi Galil
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)

Abstract

The two main results of the paper are: (1) a fine hierarchy of reversal-bounded counter machine languages; and (2) a tape is better than a pushdown store for twoway machines, in the case where their size is sublinear.

Keywords

Internal Computation Input Tape Counter Machine Pushdown Automaton Input Head 
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. [1]
    T-h. Chan, “Reversal complexity of counter machines,” Proc. 13th Annual STOC, Milwaukee, 1981, pp. 146–157.Google Scholar
  2. [2]
    P. DŪri¯s and Z. Galil, “Fooling a two-way automaton or one pushdown store is better than one counter for two-way machines,” Proc. 13th Annual STOC, Milwaukee, 1981, pp. 177–188.Google Scholar
  3. [3]
    A.R. Freedman and R.E. Ladner, “Space bounds for processing contentless inputs,” JCSS 11 (1975), 118–128.MathSciNetzbMATHGoogle Scholar
  4. [4]
    Z. Galil, “Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages,” Math. Sys. Theory 10 (1977), 211–228.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • Pavol Dūri¯s
    • 1
  • Zvi Galil
    • 2
  1. 1.Computer CenterSlovak Academy of ScienceBratislavaCzechoslovakia
  2. 2.School of Mathematical SciencesTel-Aviv UniversityTel-AvivIsrael

Personalised recommendations