{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:24:58Z","timestamp":1781893498312,"version":"3.54.5"},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1976,11,1]],"date-time":"1976-11-01T00:00:00Z","timestamp":215654400000},"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":13407,"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":[[1976,11]]},"DOI":"10.1016\/0304-3975(76)90024-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"213-224","source":"Crossref","is-referenced-by-count":17,"title":["On tape bounds for single letter alphabet language processing"],"prefix":"10.1016","volume":"3","author":[{"given":"J.","family":"Hartmanis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L.","family":"Berman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(76)90024-4_BIB1","author":"Aleksandrov","year":"1963"},{"key":"10.1016\/0304-3975(76)90024-4_BIB2","doi-asserted-by":"crossref","unstructured":"A.R. Freedman and R.E. Ladner, Space bounds for processing contentless inputs, J. Comput. System Sci., to appear.","DOI":"10.1016\/S0022-0000(75)80052-3"},{"key":"10.1016\/0304-3975(76)90024-4_BIB3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01746518","article-title":"Two memory bounds for the recognition of primes by automata","volume":"3","author":"Hartmanis","year":"1969","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(76)90024-4_BIB4","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321495.321508","article-title":"Some results on tape-bounded Turing machines","volume":"16","author":"Hopcroft","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(76)90024-4_BIB5","author":"Hopcroft","year":"1969"},{"key":"10.1016\/0304-3975(76)90024-4_BIB6","first-page":"234","article-title":"Riemann's hypothesis and tests for primality","author":"Miller","year":"1975","journal-title":"Proc. 7th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(76)90024-4_BIB7","first-page":"191","article-title":"Hierarchies of memory limited computations","author":"Stearns","year":"1965","journal-title":"IEEE Conference Record on Switching Circuit Theory and Logical Design"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900244?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900244?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:21:36Z","timestamp":1555125696000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397576900244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,11]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1976,11]]}},"alternative-id":["0304397576900244"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(76)90024-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1976,11]]}}}