Thumbnail
Access Restriction
Subscribed

Author Hopcroft, John ♦ Paul, Wolfgang ♦ Valiant, Leslie
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1977
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract It is shown that every deterministic multitape Turing machine of time complexity $\textit{t}(\textit{n})$ can be simulated by a deterministic Turing machine of tape complexity $\textit{t}(\textit{n})/log\textit{t}(\textit{n}).$ Consequently, for tape constructable $\textit{t}(\textit{n}),$ the class of languages recognizable by multitape Turing machines of time complexity $\textit{t}(\textit{n})$ is strictly contained in the class of languages recognized by Turing machines of tape complexity $\textit{t}(\textit{n}).$ In particular the context-sensitive languages cannot be recognized in linear time by deterministic multitape Turing machines.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1977-04-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 24
Issue Number 2
Page Count 6
Starting Page 332
Ending Page 337


Open content in new tab

   Open content in new tab
Source: ACM Digital Library