{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:22Z","timestamp":1759638862053},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,4,1]],"date-time":"1983-04-01T00:00:00Z","timestamp":418003200000},"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":11065,"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":[[1983,4]]},"DOI":"10.1016\/0022-0000(83)90010-7","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"153-170","source":"Crossref","is-referenced-by-count":4,"title":["Lower bounds on the size of deterministic parsers"],"prefix":"10.1016","volume":"26","author":[{"given":"Esko","family":"Ukkonen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(83)90010-7_BIB1","author":"Aho","year":"1972"},{"key":"10.1016\/0022-0000(83)90010-7_BIB2","article-title":"An Effect Context-Free Parsing Algorithm","author":"Earley","year":"1968"},{"key":"10.1016\/0022-0000(83)90010-7_BIB3","series-title":"Automata, Languages, and Programming","first-page":"232","article-title":"Production prefix parsing (extended abstract)","volume":"Vol. 14","author":"Geller","year":"1974"},{"key":"10.1016\/0022-0000(83)90010-7_BIB4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0304-3975(77)90033-0","article-title":"Economy of description by parsers, DPDA's and PDA's","volume":"4","author":"Geller","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(83)90010-7_BIB5","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0022-0000(83)90010-7_BIB6","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1145\/321850.321851","article-title":"On the parsing of deterministic languages","volume":"21","author":"Harrison","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(83)90010-7_BIB7","first-page":"42","article-title":"Context-free languages and Turing machine computations","volume":"Vol. 19","author":"Hartmanis","year":"1967"},{"key":"10.1016\/0022-0000(83)90010-7_BIB8","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1145\/361227.361232","article-title":"On the complexity of LR(k) testing","volume":"18","author":"Hunt","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(83)90010-7_BIB9","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/S0019-9958(65)90426-2","article-title":"On the translation of languages from left to right","volume":"8","author":"Knuth","year":"1965","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(83)90010-7_BIB10","series-title":"Proc. of the 12th Ann. IEEE Symp. on Switching and Automata Theory","first-page":"188","article-title":"Economy of description by automata, grammars and formal systems","author":"Meyer","year":"1971"},{"key":"10.1016\/0022-0000(83)90010-7_BIB11","series-title":"Proc. 10th Symp. on Mathematical Foundations of Computer Science (\u0160trbsk\u00e9 Pleso)","first-page":"442","article-title":"Negative results on the size of deterministic right parsers","volume":"Vol. 118","author":"Pittl","year":"1981"},{"key":"10.1016\/0022-0000(83)90010-7_BIB12","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/BF01933232","article-title":"The size of LALR(1) parsers","volume":"14","author":"Purdom","year":"1974","journal-title":"BIT"},{"key":"10.1016\/0022-0000(83)90010-7_BIB13","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/S0019-9958(70)90446-8","article-title":"Properties of deterministic top-down grammars","volume":"17","author":"Rosenkrantz","year":"1970","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(83)90010-7_BIB14","series-title":"Proc. 8th Int. Colloquium on Automata, Languages and Programming (Acre)","first-page":"218","article-title":"On size bounds for deterministic parsers","volume":"Vol. 115","author":"Ukkonen","year":"1981"},{"key":"10.1016\/0022-0000(83)90010-7_BIB15","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0019-9958(76)90173-X","article-title":"A note on the succinctness of descriptions of deterministic languages","volume":"32","author":"Valiant","year":"1976","journal-title":"Inform. and Control"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900107?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900107?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:50:48Z","timestamp":1550307048000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000083900107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,4]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,4]]}},"alternative-id":["0022000083900107"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(83)90010-7","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1983,4]]}}}