Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen

Vorträge In Der Reihenfolge Des Programms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 48)


SIGACT News Marking Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Alt,H.: Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen, Dissertation, Saarbrücken 1976Google Scholar
  2. [2]
    Alt, H. / Mehlhorn, K.: Lower Bounds for the Space Complexity of Contextfree Recognition, erscheint im Tagungsband des 3rd Coll. on Automata, Languages and Programming, 1976Google Scholar
  3. [3]
    Alt, H. / Mehlhorn, K.: A Language over a Single Letter Alphabet requiring only O(log log n) Space, SIGACT NEWS, Vol. 7, 1975Google Scholar
  4. [4]
    Freedman, A.R. / Ladner, E.R.: Space Bounds Processing Contentless Inputs, ICSS, 1976.Google Scholar
  5. [5]
    Ginsburg, S.: The Mathematical Theory of Context-Free Languages, McGraw-Hill, 1972Google Scholar
  6. [6]
    Greub, W.H.: Linear Algebra, Springer-Verlag, 1967.Google Scholar
  7. [7]
    Hartmanis, J. / Berman, L.: A Note on Tape Bounds for SLA Language Processing, 16th FOCS Symposium, Berkeley, 1975Google Scholar
  8. [8]
    Hopcroft, J.W. / Ullmann, J.D.: Formal Languages and their Relation to Automata, Addison-Wesley, Reading, Mass. 1969Google Scholar
  9. [9]
    Hotz, G. / Messerschmidt, J.: Dyck-Sprachen sind in Bandkomplexität log n analysierbar, TB Univ.d.Saarlandes, 1974Google Scholar
  10. [10]
    Lewis, P.M. / Hartmanis, J. / Stearns, R.E.: Memory Bounds for the Recognition of Context-Free and Context-Sensitive Languages, IEEE Conference Record on Switching Circuit Theory and Logical Design, 179–202, 1965Google Scholar
  11. [11]
    Lynch, N.: Log Space Recognition and Translation of Paranthesis Languages, USC, 1975 — JulyGoogle Scholar
  12. [12]
    Mehlhorn, K.: Komplexitätstheorie, Vorlesungsskript WS 1975/76, Univ.d.SaarlandesGoogle Scholar
  13. [13]
    Mehlhorn, K.: Bracket Languages are Recognizable in Logarithmic Space, TB Univ.d.Saarlandes, 1975Google Scholar
  14. [14]
    Monien, B.: About the Deterministic Simulation of Nondeterministic (log n)-Tape Bounded Turing Machines, 2-te GI Fachtagung, Kaiserslautern, 1975Google Scholar
  15. [15]
    Springsteel / Ritchie: Language Recognition by Marking Automata, Information & Control, 1972, Nr.4, May, 313–330Google Scholar
  16. [16]
    Stearns, R.E.: A Regularity Test for Pushdown-Machines, Information & Control, 11, 1967, 323–340Google Scholar
  17. [17]
    Sudborough, I.H.: On Tape Bounded Classes and Multihead Finite Automata, 14th SWAT Symposium, 1973, 138–144Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • H. Alt

There are no affiliations available

Personalised recommendations