{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T04:00:42Z","timestamp":1649044842599},"reference-count":9,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1985,5,1]],"date-time":"1985-05-01T00:00:00Z","timestamp":483753600000},"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":[[1985,5]]},"DOI":"10.1016\/0020-0190(85)90047-x","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"183-188","source":"Crossref","is-referenced-by-count":3,"title":["Fair derivations in E0L systems"],"prefix":"10.1016","volume":"20","author":[{"given":"K.","family":"Rangarajan","sequence":"first","affiliation":[]},{"given":"S.","family":"Arun-Kumar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(85)90047-X_BIB1","series-title":"Draft copy of a book on Fairness","author":"Francez","year":"1983"},{"key":"10.1016\/0020-0190(85)90047-X_BIB2","series-title":"Proc. Internat. Symp. on Algorithmic Languages","article-title":"A proof rule for fair termination of guarded commands","author":"Grumberg","year":"1981"},{"key":"10.1016\/0020-0190(85)90047-X_BIB3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0019-9958(74)80051-3","article-title":"Closure properties of some families of languages associated with biological systems","volume":"24","author":"Herman","year":"1974","journal-title":"Information and Control"},{"key":"10.1016\/0020-0190(85)90047-X_BIB4","series-title":"Developmental Systems and Languages","author":"Herman","year":"1975"},{"key":"10.1016\/0020-0190(85)90047-X_BIB5","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/S0019-9958(82)90496-X","article-title":"Fair derivations in context-free grammars","volume":"55","author":"Porat","year":"1982","journal-title":"Information and Control"},{"issue":"10\/11","key":"10.1016\/0020-0190(85)90047-X_BIB6","first-page":"543","article-title":"A new parsing algorithm for E0L-systems","volume":"18","author":"Rajasethupathy","year":"1982","journal-title":"EIK"},{"key":"10.1016\/0020-0190(85)90047-X_BIB7","series-title":"The Mathematical Theory of L-Systems","author":"Rozenberg","year":"1980"},{"key":"10.1016\/0020-0190(85)90047-X_BIB8","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/0020-0190(85)90047-X_BIB9","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0019-9958(69)90050-3","article-title":"On equal matrix languages","volume":"14","author":"Siromoney","year":"1969","journal-title":"Information and Control"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908590047X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908590047X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:26:55Z","timestamp":1553592415000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001908590047X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,5]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,5]]}},"alternative-id":["002001908590047X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(85)90047-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1985,5]]}}}