1. Lower bounds for the space complexity of context-free recognition;Alt,1976
2. Alternation;Chandra;J. ACM,1981
3. On time complexity of deterministic and nondeterministic Turing machines;Freivalds;Latvian Math.,1979
4. Nondeterministic computations in sublogarithmic space and space constructibility;Geffert;SIAM J. Comput.,1991
5. Formal Languages and Their Relation to Automata;Hopcroft,1969