{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:43Z","timestamp":1759637683949},"reference-count":8,"publisher":"Elsevier BV","issue":"1-2","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(83)90071-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"197-214","source":"Crossref","is-referenced-by-count":4,"title":["On inherently ambiguous E0L languages"],"prefix":"10.1016","volume":"28","author":[{"given":"A.","family":"Ehrenfeucht","sequence":"first","affiliation":[]},{"given":"G.","family":"Rozenberg","sequence":"additional","affiliation":[]},{"given":"R.","family":"Verraedt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90071-3_BIB1","volume":"Vol. II","author":"Dickson","year":"1944"},{"key":"10.1016\/0304-3975(83)90071-3_BIB2","first-page":"187","article-title":"On the structure of polynomially bounded D0L systems","volume":"2","author":"Ehrenfeucht","year":"1979","journal-title":"Fund. Inform."},{"issue":"2","key":"10.1016\/0304-3975(83)90071-3_BIB3","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(80)90025-0","article-title":"On ambiguity in E0L systems","volume":"12","author":"Ehrenfeucht","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(83)90071-3_BIB4","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0304-3975(83)90071-3_BIB5","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(80)90026-2","article-title":"Synchronized E0L forms","volume":"12","author":"Maurer","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(83)90071-3_BIB6","series-title":"The Mathematical Theory of L Systems","author":"Rozenberg","year":"1980"},{"key":"10.1016\/0304-3975(83)90071-3_BIB7","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/S0022-0000(75)80072-9","article-title":"Ambiguity in the developmental systems of Lindenmayer","volume":"11","author":"Reedy","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(83)90071-3_BIB8","series-title":"Formal Languages","author":"Salomaa","year":"1973"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900713?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900713?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:50:07Z","timestamp":1555127407000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583900713"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":8,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1983]]}},"alternative-id":["0304397583900713"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90071-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}