Complexity of some problems concerning L systems

Preliminary report
  • Neil D. Jones
  • Sven Skyum
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 52)


  1. [1]
    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.Google Scholar
  2. [2]
    Hopcroft, J.E., Ullman, J.D. Formal Languages and their Relation to Automata, Addison-Wesley, 1969, 242 pp.Google Scholar
  3. [3]
    Jones, N.D., Laaser, W.T., Complete Problems for Deterministic Polynomial Time, J. Theoretical Computer Science, 1976.Google Scholar
  4. [4]
    Jones, N.D., Skyum, S., EDTOL. Membership in Polynomial Time, Technical Report, University of Aarhus, Denmark.Google Scholar
  5. [5]
    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.Google Scholar
  6. [6]
    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.Google Scholar
  7. [7]
    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.Google Scholar
  8. [8]
    Stockmeyer, L.J., Meyer, A.R., Word Problems requiring Exponential Time, 5th ACM Symposium on Theory of Computing, May 1973, pp. 1–9.Google Scholar
  9. [9]
    Sudborough, I.H., A note on Tape-bounded Complexity Classes and Linear Context-free Languages, J. ACM 22, 1975, pp. 499–500.Google Scholar
  10. [10]
    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.Google Scholar
  11. [11]
    van Leeuwen, J., The Membership Question for ET0L Languages is Polynomially Complete, Information Processing Letters 3, 1975, pp. 138–143.Google Scholar
  12. [12]
    van Leeuwen, J., The Tape Complexity of Context-independent Developmental Languages, J. Computer and Systems Sciences 15, 1975, pp. 203–211.Google Scholar
  13. [13]
    Younger, D.H., Recognition and Parsing of Context-free Languages in Time n3, Information and Control 10:2, pp. 189–208.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Neil D. Jones
    • 1
  • Sven Skyum
    • 1
  1. 1.Department of Computer ScienceUniversity of AarhusAarhusDenmark

Personalised recommendations