{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:55:05Z","timestamp":1757627705046,"version":"3.44.0"},"reference-count":3,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12981,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100000046","name":"National Research Council Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000046","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1978]]},"DOI":"10.1016\/0304-3975(78)90005-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"69-92","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":18,"title":["On two-symbol complete EOL forms"],"prefix":"10.1016","volume":"6","author":[{"suffix":"II","given":"K.","family":"\u010culik","sequence":"first","affiliation":[]},{"given":"H.A.","family":"Maurer","sequence":"additional","affiliation":[]},{"given":"Th.","family":"Ottmann","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(78)90005-1_BIB1","series-title":"Report 55","article-title":"Propagating chain-free normal forms for EOL systems","author":"\u010culik","year":"1977"},{"key":"10.1016\/0304-3975(78)90005-1_BIB2","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."},{"year":"1973","series-title":"Formal Languages","author":"Salomaa","key":"10.1016\/0304-3975(78)90005-1_BIB3"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397578900051?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397578900051?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:17:59Z","timestamp":1757477879000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397578900051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":3,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1978]]}},"alternative-id":["0304397578900051"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(78)90005-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1978]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On two-symbol complete EOL forms","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(78)90005-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1978 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}