Skip to main content
SpringerLink
Log in

On languages accepted by space-bounded oracle machines

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

Characterizations of classes of languages accepted by space-bounded oracle machines are developed. These characterizations are given in terms of the regular sets, certain information about the oracle set, and certain algebraic closure operations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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

Author information

Authors and Affiliations

  1. Department of Mathematics, University of California at Santa Barbara, 93106, Santa Barbara, California, USA

    Ronald V. Book

Authors
  1. Ronald V. Book
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported in part by the National Science Foundation under Grant MCS77-11360

Rights and permissions

Reprints and permissions

About this article

Cite this article

Book, R.V. On languages accepted by space-bounded oracle machines. Acta Informatica 12, 177–185 (1979). https://doi.org/10.1007/BF00266049

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00266049

Key words

Search

Navigation