Lower bounds on space complexity for contextfree recognition-Reference-Cited by-同舟云学术

Lower bounds on space complexity for contextfree recognition

Published:1979-06 Issue:1 Volume:12 Page:33-61
ISSN:0001-5903
Container-title:Acta Informatica
language:en
Short-container-title:Acta Informatica

Author:

Alt Helmut

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00264016.pdf

Reference17 articles.

1. Alt, H.: Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen, Dissertation, Saarbrücken, 1976

2. Alt, H., Mehlhorn, K.: Lower Bounds for the Space Complexity of Contextfree Recognition, 3rd Coll. on Automata, Languages and Programming, Edinburgh, 1976

3. Alt, H. Mehlhorn, K.: A Language over a Single Letter Alphabet requiring only O(log log n) Space. SIGACT NEWS, Vol. 7 (1975)

4. Fredman, A.R., Ladner, E.R.: Space Bounds Processing Contentless Inputs, JCSS, 1976

5. Ginsburg, S.: The Mathematical Theory of Context-Free Languages, McGraw-Hill, 1972

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A combinatorial characterization of smooth LTCs and applications;Random Structures & Algorithms;2016-02-19

2. Magic numbers in the state hierarchy of finite automata;Information and Computation;2007-11

3. The Sublogarithmic Alternating Space World;SIAM Journal on Computing;1996-08

4. A lower bound for the nondeterministic space complexity of context-free recognition;Information Processing Letters;1992-04

5. Some classes of languages in NC1;Information and Computation;1991-01