About the derivation languages of grammars and machines

  • Burkhard Monien
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 52)


  1. 1.
    Aho, A.V., Hoporoft, J.E. and Ullman, J.D.: The Design and Analysis of Computer Algorithms, Addison-Wesley Publ. Comp., Reading-Massachusetts, 1974Google Scholar
  2. 2.
    Bock, R.V. and Greibach, S.A.: Quasi — Realtime Languages, Math. Systems Theory 4, 97–111 (1970).Google Scholar
  3. 3.
    Cook, S.A. and Reckhow, R.A.: Time Bounded Random Access Machines, J. Comp. Syst. Sciences 7, 354–375 (1973).Google Scholar
  4. 4.
    Gray, J.N., Harrison, M.A. and Ibarra, O.H.: Two-Way Pushxdown Automata, Information and Control 11, 30–70 (1967).Google Scholar
  5. 5.
    Hopcroft, J.E., and Ullman, J.D.: Formal Languages and their Relation to Automata, Addison-Wesley Publ. Comp., Reading — Massachusetts (1969).Google Scholar
  6. 6.
    Hopcroft, J.E., Paul, W. and Valiant, L.: On time versus space and related problems, 8-th Ann.Symp. Th. Computing, 57–64 (1967).Google Scholar
  7. 7.
    Igarashi, Y.: The Tape-Complexity of Some Classes of Szilard Languages, Report Nr. 81, University of Leeds, England.Google Scholar
  8. 8.
    Monien, B.: Characterizations of time-bounded computations by limited primitive recursion, 2nd colloquium, Automata Languages and Programming, 280–293 (1974).Google Scholar
  9. 9.
    Monien, B.: Über die Komplexität der Ableitungssprachen von Grammatiken und Maschinen, Bericht Nr. 35, Abtl. Informatik, Universität Dortmund (1976).Google Scholar
  10. 10.
    Salomaa, A.: Formal Languages, Academic Press, New York and London, 1973.Google Scholar
  11. 11.
    Stoß, H.J.: Zwei-Band Simulation von Turingmaschinen. Computing 7, 222–235 (1971).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Burkhard Monien
    • 1
  1. 1.Gesamthochschule PaderbornFachbereich Mathematik - InformatikGermany

Personalised recommendations