Skip to main content
SpringerLink
Log in

Real-time computations with restricted nondeterminism

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

By restricting the number of nondeterministic moves permitted during a real-time Turing machine computation, an infinite hierarchy can be exhibited between the real-time definable languages of Rosenberg and the quasi-real-time languages of Book and Greibach.

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.

Similar content being viewed by others

References

  1. S. O. Aanderaa, Onk-tape versus (k-1)-tape Real Time Computation, inComplexity of Computation, SIAM-AMS Proceedings, Vol. VII, 75–96 (1974).

    Google Scholar 

  2. R. V. Book, and S. A. Greibach, Quasi-Realtime Languages,Math. Systems Theory, 4, 97–111 (1970).

    Google Scholar 

  3. S. A. Cook, The Complexity of Theorem Proving Procedures,Proc. of 3rd Annual ACM Symposium on Theory of Computing, 151–158 (1971).

  4. P. C. Fischer, Turing Machines with Restricted Memory Access,Inform. Control, 9, 364–379 (1966).

    Google Scholar 

  5. P. C. Fischer, A. R. Meyer, and A. L. Rosenberg, Real-Time Simulation of Multihead Tape Units,J. Assoc. Comp. Mach., 19, 590–607 (1972).

    Google Scholar 

  6. S. Ginsburg, and S. A. Greibach, Abstract Families of Languages,Memoirs of American Math. Society, No. 87, 1–32 (1969).

    Google Scholar 

  7. J. Hartmanis, and R. E. Stearns, On the Computational Complexity of Algorithms,Trans. Amer. Math. Soc., 117, 285–306 (1965).

    Google Scholar 

  8. R. M. Karp, Reducibilities among Combinatorial Problems,Complexity of Computer Computations, Plenum Press, New York, 85–104 (1972).

    Google Scholar 

  9. C. M. R. Kintala, Computations with a Restricted Number of Nondeterministic Steps, Doctoral Thesis, The Pennsylvania State University, 1977.

  10. C. M. R. Kintala, and P. C. Fischer, Computations with a Restricted Number of Nondeterministic Steps (Extended Abstract),Proc. 9th Annual Symposium on Theory of Computing, 178–185 (1977).

  11. S. Y. Kuroda, Classes of Languages and Linear-Bounded Automata,Inform. Control, 7, 207–223 (1964).

    Google Scholar 

  12. B. L. Leong, and J. Seiferas, New Real-time Simulations of Multi-head Tape Units,Proc. 9th Annual Symp. on Theory of Computing, 239–248 (1977).

  13. M. O. Rabin, and D. Scott, Finite Automata and their Decision Problems,IBM J. of Research and Development, 3, 114–125 (1959).

    Google Scholar 

  14. A. L. Rosenberg, Real-time Definable Languages,J. Assoc. Comp. Mach., 14, 645–662 (1967).

    Google Scholar 

  15. H. Yamada, Real-time Computation and Recursive Functions not Real-time Computable,IRE Trans. on Electronic Computers, EC-11, 753–760 (1962).

Download references

Author information

Author notes

  1. Chandra M. R. Kintala

    Present address: Computer Science Department, University of Southern California, USA

Authors and Affiliations

  1. Department of Computer Science, The Pennsylvania State University, USA

    Patrick C. Fischer & Chandra M. R. Kintala

Authors
  1. Patrick C. Fischer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chandra M. R. Kintala
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fischer, P.C., Kintala, C.M.R. Real-time computations with restricted nondeterminism. Math. Systems Theory 12, 219–231 (1978). https://doi.org/10.1007/BF01776575

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation