1. Aho, A.V., J.E. Hopcroft and J.D. Ullman, "The Design and Analysis of Computer Algorithms", Addison-Wesley, Reading, Mass., 1974.
2. Chandra, A.K. and L.J. Stockmeyer, "Alternation", Proc. 17th Annual IEEE Symposium on Foundations of Comp. Sci., 98–108, 1976.
3. Fürer, M., "Non-elementary lower bounds in automata theory", (in German), Diss. ETH 6122 (Ph.D. Thesis), Zürich, 1978.
4. Hopcroft, J.E., W.J. Paul and L.G. Valiant, "On Time Versus Space", Journal of the Association for Computing Machinery 24, 332–337, 1977.
5. Hunt III, H.B., "The equivalence problem for regular expressions with intersection is not polynomial in tape", Tech. Report TR 73-161, Dept. of Computer Science, Cornell University, 1973.