Preview
Unable to display preview. Download preview PDF.
References
Aho A.V,Hopcroft J.E,Ullman J.D. Time and tape complexity of pushdown automaton languages. Inf.and Control 13:3 (1968)
Aho A.V,Hopcroft J.E,Ullman J.D. The design and analysis of computer algorithms. Section 9.4. Addison-Wesley (1976)
Cook S.A. Linear time simulation of deterministic two-way pushdown automata. Proc.IFIP Congress 1971.
Rytter W. An efficient simulation of deterministic pushdown automata with many two-way and one-way heads. Inf.Proc.Letters 12:5 (1981)
Rytter W. The dynamic simulation of recursive and stack manipulating programs. Inf.Proc.Letters 13:2 (1981)
Rytter W. A note on the complexity of traversing a labyrinth. Graph Theory Conf. Lagov,Poland, february 1981
Schonhage A. Storage modification machines. SIAM J.Comp. august1981
Bird R. Tabulation techniques for recursive programs. ACM Comp. Surveys 12:4 (1980)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rytter, W. (1983). Remarks on the pyramidal structure. In: Ausiello, G., Protasi, M. (eds) CAAP'83. CAAP 1983. Lecture Notes in Computer Science, vol 159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12727-5_23
Download citation
DOI: https://doi.org/10.1007/3-540-12727-5_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12727-7
Online ISBN: 978-3-540-38714-5
eBook Packages: Springer Book Archive