1. Alt, H., Mehlhorn, K.: Lower bounds for the space complexity for context-free recognition. In: Proc. of ICALP, pp. 338–351 (1976)
2. Borodin, A., Cook, S., Pippenger, N.: Parallel computation for well-endowed rings and space-bounded probabilistic machines. Information and Control, 113–136 (1983)
3. Condon, A., Lipton, R.: On interactive proofs with space-bounded verifiers. In: Proc. of 30th IEEE Annual Symp. on Found. of Comp. Science, pp. 462–467 (1989)
4. Condon, A., et al.: On the power of finite automata with both nondeterministic and probabilistic states. SIAM Journal on Computing, 739–762 (1998)
5. Dwork, C., Stockmeyer, L.: Interactive proof systems with finite state verifiers. IBM Report RJ 6262 (1988)