{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T15:11:59Z","timestamp":1648739519093},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1016\/0020-0190(92)90205-a","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T23:27:56Z","timestamp":1034292476000},"page":"225-227","source":"Crossref","is-referenced-by-count":5,"title":["A relationship between nondeterministic Turing machines and 1-inkdot turing machines with small space"],"prefix":"10.1016","volume":"43","author":[{"given":"Katsushi","family":"Inoue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Ito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Itsuo","family":"Takanami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90205-A_BIB1","series-title":"Proc. 3rd. Coll. on Automata, Languages and Programming","first-page":"339","article-title":"Lower bounds for the space complexity of context-free recognition","author":"Alt","year":"1976"},{"key":"10.1016\/0020-0190(92)90205-A_BIB2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(92)90205-A_BIB3","first-page":"158","article-title":"On time complexity of deterministic and nondeterministic Turing machines","volume":"23","author":"Freivalds","year":"1979","journal-title":"Latvian Math."},{"issue":"3","key":"10.1016\/0020-0190(92)90205-A_BIB4","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1137\/0220031","article-title":"Nondeterministic computations in sublogarithmic space and space constructibility","volume":"20","author":"Geffert","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90205-A_BIB5","series-title":"Formal Languages and Their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/0020-0190(92)90205-A_BIB6","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(91)90391-E","article-title":"Space bounded computations: review and new separation results","volume":"80","author":"Ranjan","year":"1991","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290205A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290205A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T12:52:29Z","timestamp":1554987149000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290205A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["002001909290205A"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90205-a","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}