At Computer Science Department, University of Kansas, Lawrence, Kansas, USA after summer 1977. Research partially supported by University of Kansas General Research Grant 3802–2038.
Chapter PDF
References
Alt, H., Mehlhorn, K. Lower bounds for the space complexity of context-free recognition. Automata, Languages and Programming, 338–354, July 1976, University Press, Edinburgh, Scotland.
Hopcroft, J.E., Ullman, J.D. Formal Languages and their Relation to Automata, Addison-Wesley, 1969, 242 pp.
Jones, N.D., Laaser, W.T., Complete Problems for Deterministic Polynomial Time, J. Theoretical Computer Science, 1976.
Jones, N.D., Skyum, S., EDTOL. Membership in Polynomial Time, Technical Report, University of Aarhus, Denmark.
Lewis, P.M., Stearns, R.E., Hartmanis, J., Memory Bounds for the Recognition of Context-free and Context-sensitive Languages, IEEE Conf. Record on Switching Circuit Theory and Logical Design, Ann Arbor, Michigan, pp. 191–202.
Meyer, A.R., Stockmeyer, L.J., The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space, 13th IEEE Symposium on Switching and Automata Theory, Oct. 1972, pp. 125–129.
Opatrný, J., Culik, K. II, Time Complexity of L Languages, Abstracts of papers, Conference on formal languages, automata and development, University of Utrecht, Netherlands, 1975.
Stockmeyer, L.J., Meyer, A.R., Word Problems requiring Exponential Time, 5th ACM Symposium on Theory of Computing, May 1973, pp. 1–9.
Sudborough, I.H., A note on Tape-bounded Complexity Classes and Linear Context-free Languages, J. ACM 22, 1975, pp. 499–500.
Sudborough, I.H., The Complexity of the Membership Problem for some Extensions of Context-free Languages, Technical Report, Northwestern University Computer Science Dept., Evanston, Ill., 1976.
van Leeuwen, J., The Membership Question for ET0L Languages is Polynomially Complete, Information Processing Letters 3, 1975, pp. 138–143.
van Leeuwen, J., The Tape Complexity of Context-independent Developmental Languages, J. Computer and Systems Sciences 15, 1975, pp. 203–211.
Younger, D.H., Recognition and Parsing of Context-free Languages in Time n3, Information and Control 10:2, pp. 189–208.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jones, N.D., Skyum, S. (1977). Complexity of some problems concerning L systems. 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_23
Download citation
DOI: https://doi.org/10.1007/3-540-08342-1_23
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