Theory of One Tape Linear Time Turing Machines
Abstract
A theory of one-tape (one-head) linear-time Turing machines is essentially different from its polynomial-time counterpart since these machines are closely related to finite state automata. This paper discusses structural-complexity issues of one-tape Turing machines of various types (deterministic, nondeterministic, reversible, alternating, probabilistic, counting, and quantum Turing machines) that halt in linear time, where the running time of a machine is defined as the length of any longest computation path. We explore structural properties of one-tape linear-time Turing machines and clarify how the machines' resources affect their computational patterns and power.
Keywords
Cite
@article{arxiv.cs/0310046,
title = {Theory of One Tape Linear Time Turing Machines},
author = {Kohtaro Tadaki and Tomoyuki Yamakami and Jack C. H. Lin},
journal= {arXiv preprint arXiv:cs/0310046},
year = {2010}
}
Comments
26 pages, 10pt, letter size. A few corrections. This is a complete version of the paper that appeared in the Proceedings of the 30th SOFSEM Conference on Current Trends in Theory and Practice of Computer Science, Lecture Notes in Computer Science, Vol.2932, pp.335-348, Springer-Verlag, January 24-30, 2004