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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
T-h. Chan, “Reversal complexity of counter machines,” Proc. 13th Annual STOC, Milwaukee, 1981, pp. 146–157.
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.
A.R. Freedman and R.E. Ladner, “Space bounds for processing contentless inputs,” JCSS 11 (1975), 118–128.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dūri¯s, P., Galil, Z. (1982). On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012766
Download citation
DOI: https://doi.org/10.1007/BFb0012766
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11576-2
Online ISBN: 978-3-540-39308-5
eBook Packages: Springer Book Archive