Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference31 articles.
1. Space complexity of alternating Turing machines;Albers,1985
2. A lower bound for the nondeterministic space complexity of context-free recognition;Alt;Inform. Process. Lett.,1992
3. A language over a one symbol alphabet requiring onlyOn;Alt;SIGACT News,1975
4. An optimal lower bound for nonregular languages;Bertoni;Inform. Process. Lett.,1994
5. Strong optimal lower bounds for Turing machines that accept nonregular languages;Bertoni,1995
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献