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

Authors:
Andreas Klein;Martin Kutrib
Affiliations:
Institute of Informatics, University of Giessen, Arndtstrasse 2, D-35392 Giessen, Germany;Institute of Informatics, University of Giessen, Arndtstrasse 2, D-35392 Giessen, Germany
Venue:
Theoretical Computer Science
Year:
2002

Citing 3
Cited 1

Real-Time Definable Languages

Journal of the ACM (JACM)
Computational Complexity of One-Tape Turing Machine Computations

Journal of the ACM (JACM)
The tight deterministic time hierarchy

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing

Refining nondeterminism below linear time

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures

Quantified Score

Hi-index	5.23

Visualization

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.