On languages accepted by space-bounded oracle machines

1. Baker, T., Gill, J., Solovay, R.: Relativizations of P=? NP question. SIAM J. Computing 4, 431–442 (1975)

   Google Scholar 

2. Book, R.: On languages accepted in polynomial time. SIAM J. Computing 1, 281–287 (1972)

   Google Scholar 

3. Book, R.: Simple representations of certain classes of languages. J.Assoc. Computing Mach. 25, 23–31 (1978)

   Google Scholar 

4. Book, R.: Polynomial space and transitive closure. SIAM J. Computing, 8, in press (1979)

5. Book, R., Nivat, M.: Linear languages and the intersection closures of classes of languages. SIAM J. Computing 7, 167–177 (1978)

   Google Scholar 

6. Book, R., Wrathall, C.: On languages specified by relative acceptance. Theoret. Comput. Sci. 7, 185–195 (1978)

   Google Scholar 

7. Jones, N.: Formal Languages and Rudimentary Attributes, Ph.D. dissertation. University of Western Ontario, London, Ont., 1967

   Google Scholar 

8. Jones, N.: Classes of automata and transitive closure. Info. Control 13, 207–229 (1968)

   Google Scholar 

9. McKloskey, T.: Abstract families of length-preserving processors. J. Comput. Systm Sci. 10, 394–427 (1975)

   Google Scholar 

10. Simon, I.: On Some Subrecursive Reducibilities, Ph.D. dissertation. Stanford University, Stanford, Ca. 1977

    Google Scholar 

11. Simon, I., Gill, J.: Polynomial reducibilities and upwards diagonalizations. Proc. 9th ACM Symp. Theory of Computing 186–194 (1977)

12. Wrathall, C.: Rudimentary predicates and relative computation. SIAM J. Computing 7, 194–209 (1978)

    Google Scholar 

13. Book, R.: Time, space, and relativizations, in preparation.

Download references