{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:56Z","timestamp":1759638836010},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1968,8,1]],"date-time":"1968-08-01T00:00:00Z","timestamp":-44755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":16421,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1968,8]]},"DOI":"10.1016\/s0022-0000(68)80027-3","type":"journal-article","created":{"date-parts":[[2008,1,3]],"date-time":"2008-01-03T10:37:03Z","timestamp":1199356623000},"page":"117-135","source":"Crossref","is-referenced-by-count":30,"title":["Tape-reversal bounded turing machine computations"],"prefix":"10.1016","volume":"2","author":[{"given":"J.","family":"Hartmanis","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(68)80027-3_bib1","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"Blum","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/S0022-0000(68)80027-3_bib2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","volume":"117","author":"Hartmanis","year":"1965","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/S0022-0000(68)80027-3_bib3","first-page":"31","article-title":"Classification of computations by time and memory requirements","volume":"Vol. 1","author":"Hartmanis","year":"1965"},{"key":"10.1016\/S0022-0000(68)80027-3_bib4","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/S0019-9958(65)90399-2","volume":"8","author":"Hennie","year":"1965","journal-title":"Inform. Control"},{"key":"10.1016\/S0022-0000(68)80027-3_bib5","unstructured":"J. Hartmanis. Computational Complexity of One-Tape Turing Machine Computations. J. ACM (to be published)."},{"key":"10.1016\/S0022-0000(68)80027-3_bib6","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02759719","volume":"1","author":"Rabin","year":"1963","journal-title":"Israel J. Math."},{"key":"10.1016\/S0022-0000(68)80027-3_bib7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1090\/S0002-9947-1963-0158822-2","volume":"106","author":"Ritchie","year":"1963","journal-title":"Trans. Am. Math. Soc."},{"issue":"No. 2","key":"10.1016\/S0022-0000(68)80027-3_bib8","article-title":"An Efficient Recognition and Syntax-Analysis Algorithm for Context-Free Languages","author":"Kasami","year":"1965","journal-title":"Report of University of Hawaii, Contract No. AF 19(628)-4379"},{"key":"10.1016\/S0022-0000(68)80027-3_bib9","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0019-9958(67)80007-X","volume":"10","author":"Younger","year":"1967","journal-title":"Inform. Control"},{"key":"10.1016\/S0022-0000(68)80027-3_bib10","series-title":"1965 IEEE Conference Record on Switching Circuit Theory and Logical Design","first-page":"191","article-title":"Memory bounds for recognition of context-free and context-sensitive languages","author":"Lewis","year":"1965"},{"key":"10.1016\/S0022-0000(68)80027-3_bib11","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/S0022-0000(67)80013-8","volume":"1","author":"Hopcroft","year":"1967","journal-title":"J. Computer Syst. Sci."},{"key":"10.1016\/S0022-0000(68)80027-3_bib12","series-title":"Proceedings of the 8th Annual Symposium on Switching and Automata Theory","article-title":"On the complexity of undecidable problems in automata theory","author":"Hartmanis","year":"1967"},{"key":"10.1016\/S0022-0000(68)80027-3_bib13","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1145\/321328.321337","volume":"31","author":"Minsky","year":"1966","journal-title":"J. ACM"},{"key":"10.1016\/S0022-0000(68)80027-3_bib14","unstructured":"J. Hartmanis and H. Shank. On the Recognition of Primes by Automata. J. ACM (to be published)."},{"key":"10.1016\/S0022-0000(68)80027-3_bib15","unstructured":"M. Blum, private communication."},{"key":"10.1016\/S0022-0000(68)80027-3_bib16","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0022-0000(68)80028-5","article-title":"The Reduction of Tape Reversals for Off-line One-tape Turing Machines","volume":"2","author":"Fischer","year":"1968","journal-title":"J. Computer Syst. Sci."},{"key":"10.1016\/S0022-0000(68)80027-3_bib17","author":"Ginsburg","year":"1967"},{"key":"10.1016\/S0022-0000(68)80027-3_bib18","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1137\/0304034","volume":"4","author":"Ginsburg","year":"1966","journal-title":"SIAM J. Control"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000068800273?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000068800273?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T18:25:52Z","timestamp":1546367152000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000068800273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1968,8]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1968,8]]}},"alternative-id":["S0022000068800273"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(68)80027-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1968,8]]}}}