Chapter PDF
References
Aho, A.V., Hoporoft, J.E. and Ullman, J.D.: The Design and Analysis of Computer Algorithms, Addison-Wesley Publ. Comp., Reading-Massachusetts, 1974
Bock, R.V. and Greibach, S.A.: Quasi — Realtime Languages, Math. Systems Theory 4, 97–111 (1970).
Cook, S.A. and Reckhow, R.A.: Time Bounded Random Access Machines, J. Comp. Syst. Sciences 7, 354–375 (1973).
Gray, J.N., Harrison, M.A. and Ibarra, O.H.: Two-Way Pushxdown Automata, Information and Control 11, 30–70 (1967).
Hopcroft, J.E., and Ullman, J.D.: Formal Languages and their Relation to Automata, Addison-Wesley Publ. Comp., Reading — Massachusetts (1969).
Hopcroft, J.E., Paul, W. and Valiant, L.: On time versus space and related problems, 8-th Ann.Symp. Th. Computing, 57–64 (1967).
Igarashi, Y.: The Tape-Complexity of Some Classes of Szilard Languages, Report Nr. 81, University of Leeds, England.
Monien, B.: Characterizations of time-bounded computations by limited primitive recursion, 2nd colloquium, Automata Languages and Programming, 280–293 (1974).
Monien, B.: Über die Komplexität der Ableitungssprachen von Grammatiken und Maschinen, Bericht Nr. 35, Abtl. Informatik, Universität Dortmund (1976).
Salomaa, A.: Formal Languages, Academic Press, New York and London, 1973.
Stoß, H.J.: Zwei-Band Simulation von Turingmaschinen. Computing 7, 222–235 (1971).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Monien, B. (1977). About the derivation languages of grammars and machines. In: Salomaa, A., Steinby, M. (eds) Automata, Languages and Programming. ICALP 1977. Lecture Notes in Computer Science, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08342-1_26
Download citation
DOI: https://doi.org/10.1007/3-540-08342-1_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08342-9
Online ISBN: 978-3-540-37305-6
eBook Packages: Springer Book Archive