This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Literaturverzeichnis
Aho, A. V., Hopcroft, E. H., Ullman, J. D.: "The Design and Analysis of Computer Algorithms", Addison-Wesley, Reding (mass.), 1974.
Hotz, G., Claus, V.: "Automatentheorie und formale Sprachen, III Formale Sprachen", BI, Mannheim, 1972.
Hopcroft, E. H., Ullman, J. D.: "Formal Languages and their Relation to Automata", Addison-Wesley, Reading (Mass.), 1969.
Karp, R. M.: "Reducibility among Combinatorial Problems" in Miller, R. E., Thatcher, J. W. (ed.): "Complexity of Computer Computations", Plenum Press, New York, 1972.
Penttonen, M.: "One-Sided and Two-Sided Context in Formal Grammars", IC 25, 371–392 (1974).
Stadel, M.: "Das Normalisierungsproblem und der Zusammenhang mit der Zeitkomplexität der kontextsensitiven Analyse", Dissertation, Saarbrücken, 1976.
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stadel, M. (1977). Das Normalisierungsproblem und der Zusammenhang mit der Zeitkomplexität der kontextsensitiven Analyse. In: Theoretical Computer Science. Lecture Notes in Computer Science, vol 48. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08138-0_30
Download citation
DOI: https://doi.org/10.1007/3-540-08138-0_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08138-8
Online ISBN: 978-3-540-37389-6
eBook Packages: Springer Book Archive