Advertisement

Das Normalisierungsproblem und der Zusammenhang mit der Zeitkomplexität der kontextsensitiven Analyse

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

Keywords

Dann Gilt Nach Definition 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literaturverzeichnis

  1. [1]
    Aho, A. V., Hopcroft, E. H., Ullman, J. D.: "The Design and Analysis of Computer Algorithms", Addison-Wesley, Reding (mass.), 1974.Google Scholar
  2. [2]
    Hotz, G., Claus, V.: "Automatentheorie und formale Sprachen, III Formale Sprachen", BI, Mannheim, 1972.Google Scholar
  3. [3]
    Hopcroft, E. H., Ullman, J. D.: "Formal Languages and their Relation to Automata", Addison-Wesley, Reading (Mass.), 1969.Google Scholar
  4. [4]
    Karp, R. M.: "Reducibility among Combinatorial Problems" in Miller, R. E., Thatcher, J. W. (ed.): "Complexity of Computer Computations", Plenum Press, New York, 1972.Google Scholar
  5. [5]
    Penttonen, M.: "One-Sided and Two-Sided Context in Formal Grammars", IC 25, 371–392 (1974).Google Scholar
  6. [6]
    Stadel, M.: "Das Normalisierungsproblem und der Zusammenhang mit der Zeitkomplexität der kontextsensitiven Analyse", Dissertation, Saarbrücken, 1976.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • M. Stadel

There are no affiliations available

Personalised recommendations