{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T00:01:35Z","timestamp":1768262495366,"version":"3.49.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,4,1]],"date-time":"1989-04-01T00:00:00Z","timestamp":607392000000},"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":[[1989,4]]},"DOI":"10.1016\/0020-0190(89)90108-7","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T01:23:41Z","timestamp":1051233821000},"page":"47-51","source":"Crossref","is-referenced-by-count":23,"title":["A pumping lemma for deterministic context-free languages"],"prefix":"10.1016","volume":"31","author":[{"given":"Sheng","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(89)90108-7_BIB1","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(80)90029-8","article-title":"Two iteration theorems for the LL(k) languages","volume":"12","author":"Betty","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(89)90108-7_BIB2","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0012-365X(76)80004-0","article-title":"Normal forms of deterministic grammars","volume":"16","author":"Geller","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0020-0190(89)90108-7_BIB3","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0020-0190(89)90108-7_BIB4","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0020-0190(89)90108-7_BIB5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1145\/321752.321756","article-title":"A formalization of transition diagram systems","volume":"20","author":"Lomet","year":"1970","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(89)90108-7_BIB6","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/0020-0190(89)90108-7_BIB7","series-title":"Technical Report","article-title":"A left-part theorem for LR(k) grammars","author":"Yu","year":"1988"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089901087?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089901087?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T21:56:04Z","timestamp":1553205364000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019089901087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,4]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,4]]}},"alternative-id":["0020019089901087"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(89)90108-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1989,4]]}}}