{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T15:09:34Z","timestamp":1648912174901},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":3942,"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":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00272-9","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T20:25:18Z","timestamp":1034022318000},"page":"253-275","source":"Crossref","is-referenced-by-count":4,"title":["Deterministic Turing machines in the range between real-time and linear-time"],"prefix":"10.1016","volume":"289","author":[{"given":"Andreas","family":"Klein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Kutrib","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00272-9_BIB1","series-title":"Structural Complexity I","author":"Balc\u00e1zar","year":"1988"},{"key":"10.1016\/S0304-3975(01)00272-9_BIB2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01705890","article-title":"Quasi-realtime languages","volume":"4","author":"Book","year":"1970","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(01)00272-9_BIB3","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1109\/T-C.1969.222663","article-title":"Real-time computation by n-dimensional iterative arrays of finite-state machines","volume":"C-18","author":"Cole","year":"1969","journal-title":"Trans. Comput."},{"key":"10.1016\/S0304-3975(01)00272-9_BIB4","doi-asserted-by":"crossref","unstructured":"M.F\u00fcrer, The tight deterministic time hierarchy, in: Proc. 14th Ann. ACM Symp. on Theory of Computing, ACM Press, New York, 1982, pp. 8\u201316.","DOI":"10.1145\/800070.802172"},{"key":"10.1016\/S0304-3975(01)00272-9_BIB5","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1145\/321450.321464","article-title":"Computational complexity of one-tape turing machine computations","volume":"15","author":"Hartmanis","year":"1968","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(01)00272-9_BIB6","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\/S0304-3975(01)00272-9_BIB7","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. Control"},{"key":"10.1016\/S0304-3975(01)00272-9_BIB8","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0304-3975(85)90015-5","article-title":"On proving time constructibility of functions","volume":"35","author":"Kobayashi","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00272-9_BIB9","series-title":"Komplexit\u00e4tstheorie","author":"Paul","year":"1978"},{"key":"10.1016\/S0304-3975(01)00272-9_BIB10","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\/S0304-3975(01)00272-9_BIB11","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1145\/321420.321423","article-title":"Real-time definable languages","volume":"14","author":"Rosenberg","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(01)00272-9_BIB12","first-page":"33","article-title":"Turing machine computations with logarithmic delay","volume":"3","author":"Trakhtenbrot","year":"1964","journal-title":"Algebra i Logika"},{"key":"10.1016\/S0304-3975(01)00272-9_BIB13","series-title":"Computational Complexity","author":"Wagner","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002729?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002729?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T01:22:37Z","timestamp":1554772957000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501002729"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501002729"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00272-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}