{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T08:33:14Z","timestamp":1648974794629},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,6,1]],"date-time":"1982-06-01T00:00:00Z","timestamp":391737600000},"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":11369,"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":[[1982,6]]},"DOI":"10.1016\/0022-0000(82)90032-0","type":"journal-article","created":{"date-parts":[[2004,1,6]],"date-time":"2004-01-06T10:48:13Z","timestamp":1073386093000},"page":"362-372","source":"Crossref","is-referenced-by-count":1,"title":["Space complexity in on-line computation"],"prefix":"10.1016","volume":"24","author":[{"given":"Hajime","family":"Machida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takumi","family":"Kasai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(82)90032-0_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0022-0000(82)90032-0_BIB2","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0022-0000(74)80047-4","article-title":"Fast on-line integer multiplication","volume":"9","author":"Fischer","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(82)90032-0_BIB3","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/S0019-9958(69)90463-X","article-title":"Recognition time of context-free languages by on-line Turing machines","volume":"15","author":"Gallaire","year":"1969","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(82)90032-0_BIB4","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/321466.321470","article-title":"On the recognition of primes by automata","volume":"15","author":"Hartmanis","year":"1968","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(82)90032-0_BIB5","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\/0022-0000(82)90032-0_BIB6","series-title":"Proceedings, Seventeenth Annual Allerton Conference on Communication, Control, and Computing","article-title":"Some space-efficient algorithms","author":"Ja'Ja'","year":"1979"},{"key":"10.1016\/0022-0000(82)90032-0_BIB7","series-title":"IEEE Conference Record of Sixth Annual Symposium on Switching Circuit Thory and Logic Design","first-page":"191","article-title":"Memory bounds for recognition of context-free and context-sensitive languages","author":"Lewis","year":"1965"},{"key":"10.1016\/0022-0000(82)90032-0_BIB8","first-page":"97","article-title":"An improved overlap argument for on-line multiplication","volume":"Vol. 7","author":"Paterson","year":"1974"},{"key":"10.1016\/0022-0000(82)90032-0_BIB9","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/321450.321461","article-title":"A remark on acceptable sets of numbers","volume":"15","author":"Schutzenberger","year":"1968","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900320?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900320?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T19:23:33Z","timestamp":1550258613000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000082900320"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,6]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,6]]}},"alternative-id":["0022000082900320"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(82)90032-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1982,6]]}}}