{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T05:20:12Z","timestamp":1757568012895},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1975,8,1]],"date-time":"1975-08-01T00:00:00Z","timestamp":176083200000},"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":13865,"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":[[1975,8]]},"DOI":"10.1016\/s0022-0000(75)80052-3","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T04:46:40Z","timestamp":1289364400000},"page":"118-128","source":"Crossref","is-referenced-by-count":34,"title":["Space bounds for processing contentless inputs"],"prefix":"10.1016","volume":"11","author":[{"given":"A.R.","family":"Freedman","sequence":"first","affiliation":[]},{"given":"R.E.","family":"Ladner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(75)80052-3_bib1","author":"Hardy","year":"1960"},{"key":"10.1016\/S0022-0000(75)80052-3_bib2","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. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(75)80052-3_bib3","article-title":"Formal Languages and Their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/S0022-0000(75)80052-3_bib4","series-title":"IEEE Conf. 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(75)80052-3_bib5","series-title":"IEEE Conf. Record on Switching Circuit Theory and Logical Design","first-page":"179","article-title":"Hierarchies of memory limited computations","author":"Stearns","year":"1965"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000075800523?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000075800523?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T18:54:49Z","timestamp":1544122489000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000075800523"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,8]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1975,8]]}},"alternative-id":["S0022000075800523"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(75)80052-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1975,8]]}}}