Skip to main content
SpringerLink
Log in

Computational power of one-way turing machines with sublogarithmic memory restrictions

  • Published:
Russian Mathematics Aims and scope Submit manuscript

Abstract

This paper considers the well-known Turing machine model, the nondeterministic real-time Turing machine. The author proves the existence of nonregular complexity classes of languages that can be recognized by nondeterministic one-way Turing machines with sublogarithmic memory restrictions. And these complexity classes form a strict hierarchy. The author defines a special language family and shows its properties to prove that hierarchy.

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. Sanjeev, A., Boaz, B. Computational Complexity: A Modern Approach (Princeton University, 2006).

    Google Scholar 

  2. Rosenberg, A. L. “Real-Time Definable Languages,” J. Assoc. Comp. Mach. 14, No. 4, 645–662 (1967).

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. Patrick, C. F., Chandra, M. R. K. “Real-Time Computations with Restricted Nondeterminism,” Math. Systems Theory 12, 219–231 (1979).

    MATH  Google Scholar 

  5. Bruda, S. D., Akl, S. G. “On the Necessity of Formal Models for Real-Time Parallel Computations,” Parallel Process. Lett. 11, No. 2/3, 353–361 (2001).

    Article  Google Scholar 

  6. Kutrib, M. “Refining Nondeterminism Below Linear Time,” J. Automata, Languages and Combinatorics, 7, No. 4, 533–547 (2002).

    MATH  MathSciNet  Google Scholar 

  7. Bruda, S. D., Akl, S. G. “Real-Time Computation: A Formal Definition and its Applications,” Internat. J. Computers and Appl. 25, No. 2, 1–11 (2003).

    Google Scholar 

  8. Bruda, S. D. “Sublinear Space Real-Time Turing Machines Cannot Count,” in Proceedings of Eighth International Conference on Information Technology: ‘New Generations’, 976–978 (2011).

    Google Scholar 

  9. Hartmanis, J., Lewis, P. L. II, Stearns, R. E. “Hierarchies of Memory-Limited Computations,” in Proceedings of the 6th Annual IEEE Symposium on Switching Circuit Theory and Logic Design, 179–190 (1965).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kazan (Volga Region) Federal University, ul. Kremlyovskaya 18, Kazan, 420008, Russia

    A. N. Leshchev

Authors
  1. A. N. Leshchev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. N. Leshchev.

Additional information

Original Russian Text © A.N. Leshchev, 2014, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2014, No. 9, pp. 80–86.

Submitted by N.K. Zamov

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Leshchev, A.N. Computational power of one-way turing machines with sublogarithmic memory restrictions. Russ Math. 58, 66–70 (2014). https://doi.org/10.3103/S1066369X14090096

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S1066369X14090096

Keywords

Search

Navigation