1. Aleliunas, R., R.M. Karp, R.J. Lipton, L.Lovasz, C. Rackoff, Random walks, universal sequences, and the complexity of maze problems, Proceedings 1979 IEEE Foundations of Computer Science Conference.
2. Chandra, A.K., D. Kozen, L.J. Stockmeyer, Alternation, Technical Report RC 7489 (# 32286), IBM T.J. Watson Research Center, Yorktown Heights, New York.
3. Cook, S.A., Path systems and language recognition, 1970 ACM Symp. Theory of Computing, 70–72.
4. —, An observation on time-storage trade-off, J. Computer System Sci. (1974), 308–316.
5. —, Deterministic CFLs are accepted simultaneously in polynomial time and log squared space, 1979 ACM Symp. Theory of Computing, 338–345.