{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T21:34:58Z","timestamp":1767908098810,"version":"3.49.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1977,1,1]],"date-time":"1977-01-01T00:00:00Z","timestamp":220924800000},"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":13346,"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":[[1977]]},"DOI":"10.1016\/0304-3975(77)90036-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"199-225","source":"Crossref","is-referenced-by-count":12,"title":["On the form equivalence of L-forms"],"prefix":"10.1016","volume":"4","author":[{"given":"H.","family":"Maurer","sequence":"first","affiliation":[]},{"given":"Th.","family":"Ottmann","sequence":"additional","affiliation":[]},{"given":"A.","family":"Salomaa","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(77)90036-6_BIB1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0022-0000(75)80051-1","article-title":"Context-free grammar forms","volume":"11","author":"Cremers","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(77)90036-6_BIB2","article-title":"The sequence equivalence problem for DOL systems is decidable","author":"\u010culik","year":"1977","journal-title":"Fourth International Colloquium on Automata Languages and Programming"},{"key":"10.1016\/0304-3975(77)90036-6_BIB3","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02280886","article-title":"On strongly equivalent context-free grammar forms","volume":"16","author":"Ginsburg","year":"1976","journal-title":"Computing"},{"key":"10.1016\/0304-3975(77)90036-6_BIB4","series-title":"Developmental Systems and Languages","author":"Hermann","year":"1974"},{"key":"10.1016\/0304-3975(77)90036-6_BIB5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF00276185","article-title":"EOL forms","volume":"8","author":"Maurer","year":"1977","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(77)90036-6_BIB6","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:0304397577900366?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397577900366?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T15:16:51Z","timestamp":1704208611000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397577900366"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1977]]}},"alternative-id":["0304397577900366"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(77)90036-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1977]]}}}