{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T07:54:45Z","timestamp":1672473285059},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1988,11,1]],"date-time":"1988-11-01T00:00:00Z","timestamp":594345600000},"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":[[1988,11]]},"DOI":"10.1016\/0020-0190(88)90057-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"177-182","source":"Crossref","is-referenced-by-count":8,"title":["On a complexity hierarchy between L and NL"],"prefix":"10.1016","volume":"29","author":[{"given":"Sang","family":"Cho","sequence":"first","affiliation":[]},{"given":"Dung T.","family":"Huynh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(88)90057-9_BIB1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. & Control"},{"key":"10.1016\/0020-0190(88)90057-9_BIB2","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1137\/0304034","article-title":"Finite-turn pushdown automata","volume":"4","author":"Ginsburg","year":"1966","journal-title":"SIAM J. Control"},{"key":"10.1016\/0020-0190(88)90057-9_BIB3","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1977"},{"key":"10.1016\/0020-0190(88)90057-9_BIB4","article-title":"On some languages in NC1","author":"Ibarra","year":"1987","journal-title":"Extended abstract"},{"key":"10.1016\/0020-0190(88)90057-9_BIB5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationships between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(88)90057-9_BIB6","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/321906.321913","article-title":"A note on tape-bounded complexity classes and linear context-free languages","volume":"22","author":"Sudborough","year":"1975","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088900579?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088900579?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:54:38Z","timestamp":1555088078000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019088900579"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["0020019088900579"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(88)90057-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}