Advertisement

Input-driven languages are recognized in log n space

  • Burchard von Braunmühl
  • Rutger Verbeek
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 158)

Keywords

Turing Machine Computation Graph Input Symbol Input Tape Pushdown 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BCMV 83]
    B.v.Braunmühl, S.A. Cook, K. Mehlhorn, R. Verbeek: The recognition of deterministic CFLs in small time and space, submitted for publication.Google Scholar
  2. [BV 80]
    B.v. Braunmühl, R. Verbeek: A recognition algorithm for DCFLs optimal in time and space, Proc. 21th FOCS, pp. 411–420.Google Scholar
  3. [Co 79]
    S.A. Cook: Deterministic CFLs are accepted simultaneously in polynomial time and log squared tape, Proc. 11th ACM-STOC, pp. 338–345.Google Scholar
  4. [CS 76]
    S.A. Cook, R. Sethi: Storage requirements for deterministic polynomial time recognizable languages. JCSS 13, 25–37.Google Scholar
  5. [Ig 77]
    Y. Igarashi: The tape complexity of some classes of Szilard languages, SIAM 3. Comp. 6, pp. 460–466.Google Scholar
  6. [Ig 78]
    Y. Igarashi: Tape bounds for some subclasses of deterministic context-free languages, Inf. Contr. 37, 321–333.Google Scholar
  7. [LSH 65]
    P.M. Lewis, R.E. Stearns, J. Hartmanis: Memory bounds for the recognition of context-free and context-sensitive languages, Proc. 6th IEEE-SWAT, pp. 191–212.Google Scholar
  8. [LZ 77]
    R. Lipton, Y. Zalcstein: Word problem solvable in log-space, JACM 24, 522–526.Google Scholar
  9. [Me 75]
    K. Mehlhorn: Bracket languages are recognizable in logarithmic space, Technical report, FB 10. Universität Saarbrücken.Google Scholar
  10. [Me 80]
    K. Mehlhorn: Pebbling mountain ranges and its application to DCFL-recognition, Proc. 7th ICALP, pp. 422–432.Google Scholar
  11. [PH 70]
    M.S. Paterson, C.E. Hewitt: Comparative schematology, project MAC, Conf. on concurrent systems and parallel computation, pp. 109–127.Google Scholar
  12. [RS 72]
    R.W. Ritchie, F.N. Springsteel: Language recognition by marking automata, Inf. Contr. 20, 313–330.Google Scholar
  13. [Su 75]
    I.H. Sudborough: On tape bounded complexity classes and multi-head finite automata, JCSS 10, 177–192.Google Scholar
  14. [Ve 81]
    R. Verbeek: Time-space tradeoffs for general recursion, 22nd IEEE-FOCS, pp. 228–234.Google Scholar
  15. [Ve 83]
    R. Verbeek: Complexity of pushdown computations, Institut für Informatik der Universität Bonn.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Burchard von Braunmühl
    • 1
  • Rutger Verbeek
    • 1
  1. 1.University of BonnGermany

Personalised recommendations