{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:58Z","timestamp":1759638118825},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1985]]},"DOI":"10.1016\/0304-3975(85)90165-3","type":"journal-article","created":{"date-parts":[[2003,5,27]],"date-time":"2003-05-27T22:32:36Z","timestamp":1054074756000},"page":"175-193","source":"Crossref","is-referenced-by-count":11,"special_numbering":"C","title":["On the structure of one-tape nondeterministic turing machine time hierarchy"],"prefix":"10.1016","volume":"40","author":[{"given":"Kojiro","family":"Kobayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90165-3_BIB1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1137\/0213016","article-title":"Two tapes are better than one for nondeterministic machines","volume":"13","author":"Duris","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(85)90165-3_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(84)80019-4","article-title":"Two nonlinear lower bounds for on-line computations","volume":"60","author":"Duris","year":"1984","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(85)90165-3_BIB3","series-title":"Proc. 14th Ann. ACM Symp. on Theory of Computing","first-page":"8","article-title":"The tight deterministic time hierarchy","author":"F\u00fcrer","year":"1982"},{"key":"10.1016\/0304-3975(85)90165-3_BIB4","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","article-title":"On the computational complexity of algorithms","volume":"117","author":"Hartmanis","year":"1965","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(85)90165-3_BIB5","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/S0019-9958(65)90399-2","article-title":"One-tape off-line Turing machine computations","volume":"8","author":"Hennie","year":"1965","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(85)90165-3_BIB6","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1145\/321466.321474","article-title":"Relations between time and tape complexities","volume":"15","author":"Hopcroft","year":"1968","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(85)90165-3_BIB7","series-title":"Formal Languages and their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/0304-3975(85)90165-3_BIB8","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1137\/0203014","article-title":"A hierarchy theorem for polynomial-space recognition","volume":"3","author":"Ibarra","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(85)90165-3_BIB9","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1137\/0212025","article-title":"Some time-space tradeoff results concerning single-tape and offline TM's","volume":"12","author":"Ibarra","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(85)90165-3_BIB10","first-page":"1","article-title":"Three approaches to the quantitative definition of information","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0304-3975(85)90165-3_BIB11","series-title":"Proc. 16th Ann. ACM Symp. on Theory of Computing","first-page":"401","article-title":"Quadratic lower bounds for deterministic and nondeterministic one-tape Turing machines","author":"Maass","year":"1984"},{"key":"10.1016\/0304-3975(85)90165-3_BIB12","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/S0022-0000(72)80017-5","article-title":"Tape bounds for time-bounded Turing machines","volume":"6","author":"Paterson","year":"1972","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(85)90165-3_BIB13","series-title":"2nd Internat. Conf. on Fundamentals of Computation Theory","first-page":"325","article-title":"Kolmogorov complexity and lower bounds","author":"Paul","year":"1979"},{"key":"10.1016\/0304-3975(85)90165-3_BIB14","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0022-0000(79)90028-X","article-title":"On time hierarchies","volume":"19","author":"Paul","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(85)90165-3_BIB15_1","series-title":"Proc. 22nd Ann. Symp. on Foundations of Computer Science","first-page":"68","article-title":"On heads versus tapes","author":"Paul","year":"1981"},{"issue":"1, 2","key":"10.1016\/0304-3975(85)90165-3_BIB15_2","first-page":"1","volume":"28","author":"Paul","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90165-3_BIB16","series-title":"Proc. 23rd Ann. Symp. on Foundations of Computer Science","first-page":"53","article-title":"On-line simulation of k+1 tapes by k tapes requires nonlinear time","author":"Paul","year":"1982"},{"key":"10.1016\/0304-3975(85)90165-3_BIB17","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF00264255","article-title":"On alternation","volume":"14","author":"Paul","year":"1980","journal-title":"Acta Inform"},{"key":"10.1016\/0304-3975(85)90165-3_BIB18","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/BF00286494","article-title":"On alteration II","volume":"14","author":"Paul","year":"1980","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(85)90165-3_BIB19","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0022-0000(81)90009-X","article-title":"An information-theoretic approach to time bounds for on-line computation","volume":"23","author":"Paul","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(85)90165-3_BIB20","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02759719","article-title":"Real time computation","volume":"1","author":"Rabin","year":"1963","journal-title":"Israel J. Math."},{"key":"10.1016\/0304-3975(85)90165-3_BIB21","series-title":"Proc. 23rd Ann. Symp. on Foundations of Computer Science","first-page":"45","article-title":"Three applications of Kolmogorov-complexity","author":"Reisch","year":"1982"},{"key":"10.1016\/0304-3975(85)90165-3_BIB22","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0304-3975(85)90165-3_BIB23","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0022-0000(77)80041-X","article-title":"Techniques for separating space complexity classes","volume":"14","author":"Seiferas","year":"1977","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0304-3975(85)90165-3_BIB24","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0022-0000(77)80042-1","article-title":"Relating refined space complexity classes","volume":"14","author":"Seiferas","year":"1977","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0304-3975(85)90165-3_BIB25","doi-asserted-by":"crossref","DOI":"10.1016\/0022-0000(84)90001-1","article-title":"Two-tape real-time computation","author":"Vitanyi","year":"1980"},{"key":"10.1016\/0304-3975(85)90165-3_BIB26","article-title":"One queue or two pushdown stores take square time on a one-head tape unit","author":"Vitanyi","year":"1984"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901653?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901653?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T21:54:16Z","timestamp":1553118856000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585901653"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":27,"alternative-id":["0304397585901653"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90165-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}