Preview
Unable to display preview. Download preview PDF.
References
Blum, M., A machine-independent theory of complexity of recursive functions. Journal ACM, 14, Nr. 2 (1967), 322–336.
Cook, S.A., Characterizations of pushdown machines in terms of time bounded computers. Journal ACM, 18, Nr. 1 (1971), 4–18.
Ginsburg, S., Substitution and (semi-)AFL. Proceedings of symposium and summer school MFCS, High Tatras, September 3–8, 1973, 65–69.
Hartmanis, J. and Hopcroft, J.E., An overview of the theory of computational complexity. Journal ACM, 18, Nr. 3 (1971), 444–475.
Hartmanis, J., Computational complexity of one-tape Turing machine computations. Journal ACM, 15, Nr. 2 (1968), 325–339.
Hartmanis, J., Tape-reversal bounded Turing machine computations. Journal CSS, 2, Nr. 2 (1968), 117–135.
Salomaa, A., Formal Languages. Academic Press, New York and London, 1973.
Trachtenbrot, B.A., Turing machine computations with logarithmic delay. (Russian). Algebra i Logika 3 (1964), 33–48.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wechsung, G. (1975). Characterization of some classes of context-free languages in terms of complexity classes. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_233
Download citation
DOI: https://doi.org/10.1007/3-540-07389-2_233
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07389-5
Online ISBN: 978-3-540-37585-2
eBook Packages: Springer Book Archive