{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T06:52:21Z","timestamp":1648968741361},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1983]]},"DOI":"10.1016\/0304-3975(82)90122-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:07:16Z","timestamp":1027652836000},"page":"287-295","source":"Crossref","is-referenced-by-count":4,"title":["More on the power of chain rules in context-free grammars"],"prefix":"10.1016","volume":"27","author":[{"given":"Norbert","family":"Blum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90122-0_BIB1","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF00264161","article-title":"On the power of chain rules in context free grammars","volume":"17","author":"Blum","year":"1982","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(82)90122-0_BIB2","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/0304-3975(82)90122-0_BIB3","doi-asserted-by":"crossref","first-page":"281","DOI":"10.4153\/CMB-1966-036-2","article-title":"On graphs that do not contain a Thomsen graph","volume":"9","author":"Brown","year":"1966","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0304-3975(82)90122-0_BIB4","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582901220?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582901220?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T22:24:59Z","timestamp":1555194299000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397582901220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983]]}},"alternative-id":["0304397582901220"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90122-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}