{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T09:08:47Z","timestamp":1672304927607},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"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,4]]},"DOI":"10.1016\/0020-0190(92)90127-h","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"25-27","source":"Crossref","is-referenced-by-count":10,"title":["A lower bound for the nondeterministic space complexity of context-free recognition"],"prefix":"10.1016","volume":"42","author":[{"given":"Helmut","family":"Alt","sequence":"first","affiliation":[]},{"given":"Viliam","family":"Geffert","sequence":"additional","affiliation":[]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90127-H_BIB1","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF00264016","article-title":"Lower bounds on space complexity for context-free recognition","volume":"12","author":"Alt","year":"1979","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(92)90127-H_BIB2","series-title":"Proc. 3rd ICALP","first-page":"338","article-title":"Lower bounds for the space complexity of context-free recognition","author":"Alt","year":"1976"},{"key":"10.1016\/0020-0190(92)90127-H_BIB3","unstructured":"V. Geffert, Tally versions of Savitch's and Immermann-Szelepcs\u00e9nyi theorems for sublogarithmic space, SIAM J. Comput., to appear."},{"key":"10.1016\/0020-0190(92)90127-H_BIB4","series-title":"Formal Languages and their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/0020-0190(92)90127-H_BIB5","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","article-title":"Nondeterministic space is closed under complementation","volume":"17","author":"Immermann","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90127-H_BIB6","first-page":"179","article-title":"Memory bounds for the recognition of context-free and context-sensitive languages","author":"Lewis","year":"1965","journal-title":"IEEE Conf. Record on Switching Circuit Theory and Logical Design"},{"key":"10.1016\/0020-0190(92)90127-H_BIB7","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0019-9958(67)90591-8","article-title":"A regularity test for pushdown-machines","author":"Stearns","year":"1967","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(92)90127-H_BIB8","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00299636","article-title":"The method of forced enumeration for nondeterministic automata","volume":"26","author":"Szelepcs\u00e9nyi","year":"1988","journal-title":"Acta Inform."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290127H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290127H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:21:18Z","timestamp":1555132878000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290127H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["002001909290127H"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90127-h","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}