Deterministic Turing machines in the range between real-time and linear-time

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by such devices with time bounds of the form n+r(n), where r∈o(n) is a sublinear function. It is shown that there exist infinite time hierarchies of separated complexity classes in that range. For these classes weak closure properties are proved. © 2002 Elsevier Science B.V. All right reserved.

Cite

CITATION STYLE

APA

Klein, A., & Kutrib, M. (2002). Deterministic Turing machines in the range between real-time and linear-time. Theoretical Computer Science, 289(1), 253–275. https://doi.org/10.1016/S0304-3975(01)00272-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free