Input-driven languages are recognized in log n space

This publication has 7 references indexed in Scilit:

• Pebbling mountain ranges and its application to DCFL-recognition
  Published by Springer Nature ,1980
• Tape bounds for some subclasses of deterministic context-free languages
  Information and Control, 1978
• The Tape Comilexity of Some Classes of Szilard Languages
  SIAM Journal on Computing, 1977
• Word Problems Solvable in Logspace
  Journal of the ACM, 1977
• Storage requirements for deterministic polynomialtime recognizable languages
  Journal of Computer and System Sciences, 1976
• Language recognition by marking automata
  Information and Control, 1972
• Memory bounds for recognition of context-free and context-sensitive languages
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1965