{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,7]],"date-time":"2024-01-07T00:01:47Z","timestamp":1704585707155},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1979,11,1]],"date-time":"1979-11-01T00:00:00Z","timestamp":310262400000},"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":12312,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1979,11]]},"DOI":"10.1016\/0166-218x(79)90040-4","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T15:17:01Z","timestamp":1034090221000},"page":"155-166","source":"Crossref","is-referenced-by-count":7,"title":["On \u03f5 productions for terminals in E0L forms"],"prefix":"10.1016","volume":"1","author":[{"given":"W.","family":"Ainhirn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.A.","family":"Maurer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(79)90040-4_BIB1","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":"Information and Control"},{"key":"10.1016\/0166-218X(79)90040-4_BIB2","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":"Theoretical Computer Science"},{"key":"10.1016\/0166-218X(79)90040-4_BIB3","series-title":"Introduction to formal language theory","author":"Harrison","year":"1976"},{"key":"10.1016\/0166-218X(79)90040-4_BIB4","series-title":"Theoretische Grundlagen der Programmier sprachen","author":"Maurer","year":"1976"},{"key":"10.1016\/0166-218X(79)90040-4_BIB5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF00276185","article-title":"E0L forms","volume":"8","author":"Maurer","year":"1977","journal-title":"Acta Informatica"},{"key":"10.1016\/0166-218X(79)90040-4_BIB6","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. Computing"},{"key":"10.1016\/0166-218X(79)90040-4_BIB7","series-title":"Formal languanges","author":"Salomaa","year":"1973"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X79900404?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X79900404?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,6]],"date-time":"2024-01-06T19:25:40Z","timestamp":1704569140000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X79900404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,11]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,11]]}},"alternative-id":["0166218X79900404"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(79)90040-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1979,11]]}}}