This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Cobham, The intrinsic computational complexity of functions, Proc. 1964 Int.Congr.Logic, Method and Philo of Sci, North Holland 1965, 24–30
S.A. Cook, Characterizations of Pushdown Machines in Terms of Time-Bounded Computers, J.Aassoc.Comput.Mach. 18(1971), 4–18
S.A.Cook, Linear Time Simulation of Deterministic 2-way PDA, ifip congress 1971, Ljubljana, Inf.Proc. 174–179
F.C. Hennie, One-tape, off-line Turing machine computations, Information and Control 8(1965), 553–578
O.H. Ibarra, On two-way multihead automata, J.Comp.Syst.Sci. 7(1973), 28–37
T. Kameda, Pushdown automata with counters, J.Comp.Syst.Sci. 6(1972), 138–150
B. Monien, Relationships between pushdown automata with counters and complexity classes, to appear in Math.Syst.Th.
Rights and permissions
Copyright information
© 1973 Springer-Verlag
About this paper
Cite this paper
Monien, B. (1973). On the simulation of time bounded machines. In: GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen. Lecture Notes in Computer Science, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039160
Download citation
DOI: https://doi.org/10.1007/BFb0039160
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06527-2
Online ISBN: 978-3-540-37826-6
eBook Packages: Springer Book Archive