单带线性时间图灵机理论
计算复杂性
2010-07-20 v3
摘要
单带（单头）线性时间图灵机理论本质上不同于其多项式时间对应理论，因为这些机器与有限状态自动机密切相关。本文讨论各类单带图灵机（确定性、非确定性、可逆、交替、概率、计数及量子图灵机）在线性时间内停机时的结构复杂性问题，其中机器的运行时间定义为任意最长计算路径的长度。我们探索单带线性时间图灵机的结构性质，并阐明机器资源如何影响其计算模式与能力。
引用
@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}
}
备注
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