{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T00:02:49Z","timestamp":1705449769877},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1980,12,1]],"date-time":"1980-12-01T00:00:00Z","timestamp":344476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":11917,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1980,12]]},"DOI":"10.1016\/s0019-9958(80)90515-x","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T09:12:12Z","timestamp":1103101932000},"page":"175-194","source":"Crossref","is-referenced-by-count":1,"title":["How to get rid of pseudoterminals"],"prefix":"10.1016","volume":"47","author":[{"given":"W.","family":"Ainhirn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(80)90515-X_bib1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-218X(79)90040-4","article-title":"On \u025b productions for terminals in E0L forms","volume":"1","author":"Ainhirn","year":"1979","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0019-9958(80)90515-X_bib2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1080\/00207167408803079","article-title":"On some families of languages related to developmental systems","volume":"4","author":"Culik","year":"1974","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/S0019-9958(80)90515-X_bib3","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S0019-9958(78)90336-4","article-title":"Propagating chain-free normal forms for E0L systems","volume":"36","author":"Culik","year":"1978","journal-title":"Inform. Contr."},{"key":"10.1016\/S0019-9958(80)90515-X_bib4","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(78)90005-1","article-title":"Two-symbol complete E0L forms","volume":"6","author":"Culik","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(80)90515-X_bib5","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1080\/00207167408803083","article-title":"The equality of E0L languages and codings of 0L languages","volume":"4","author":"Ehrenfeucht","year":"1974","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/S0019-9958(80)90515-X_bib6","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/S0019-9958(80)90515-X_bib7","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":"Inform. Contr."},{"key":"10.1016\/S0019-9958(80)90515-X_bib8","series-title":"Developmental Systems and Languages","author":"Herman","year":"1975"},{"key":"10.1016\/S0019-9958(80)90515-X_bib9","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/0022-5193(68)90079-9","article-title":"Mathemaical models for cellular interactions in development","volume":"18","author":"Lindenmayer","year":"1968","journal-title":"J. Theoret. Biol."},{"key":"10.1016\/S0019-9958(80)90515-X_bib10","series-title":"Theoretische Grundlagen der Programmiersprachen","author":"Maurer","year":"1969"},{"key":"10.1016\/S0019-9958(80)90515-X_bib11","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF00276185","article-title":"E0L forms","volume":"8","author":"Maurer","year":"1977","journal-title":"Acta Inform."},{"key":"10.1016\/S0019-9958(80)90515-X_bib12","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1137\/0207015","article-title":"On good E0L forms","volume":"7","author":"Maurer","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0019-9958(80)90515-X_bib13","series-title":"Pure Grammars","author":"Maurer","year":"1979"},{"key":"10.1016\/S0019-9958(80)90515-X_bib14","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF00288538","article-title":"On generators and generative capacity of E0L forms","volume":"13","author":"Maurer","year":"1980","journal-title":"Acta Inform."},{"key":"10.1016\/S0019-9958(80)90515-X_bib15","series-title":"The Mathematical Theory of L Systems","author":"Rozenberg","year":"1980"},{"key":"10.1016\/S0019-9958(80)90515-X_bib16","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/S0019-9958(80)90515-X_bib17","series-title":"Grammar and L Forms","author":"Wood","year":"1980"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S001999588090515X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S001999588090515X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,16]],"date-time":"2024-01-16T22:24:46Z","timestamp":1705443886000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S001999588090515X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,12]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980,12]]}},"alternative-id":["S001999588090515X"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(80)90515-x","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1980,12]]}}}