{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:55:39Z","timestamp":1757627739635,"version":"3.44.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,10,1]],"date-time":"1982-10-01T00:00:00Z","timestamp":402278400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1982,10,1]],"date-time":"1982-10-01T00:00:00Z","timestamp":402278400000},"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":11247,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["MCS 79-03838"],"award-info":[{"award-number":["MCS 79-03838"]}],"id":[{"id":"10.13039\/100000001","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":[[1982,10]]},"DOI":"10.1016\/0304-3975(82)90089-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"75-90","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Representation theorems using DOS languages"],"prefix":"10.1016","volume":"21","author":[{"given":"A.","family":"Ehrenfeucht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Rozenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90089-5_BIB1","series-title":"Technical Report 74-1","article-title":"Grammars without syntactic variables","author":"Buttlemann","year":"1974"},{"key":"10.1016\/0304-3975(82)90089-5_BIB2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0019-9958(80)90749-4","article-title":"On basic properties of DOS systems and languages","volume":"47","author":"Ehrenfeucht","year":"1980","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(82)90089-5_BIB3","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0020-0190(80)90145-3","article-title":"On the emptiness of the intersection of two DOS languages problem","volume":"10","author":"Ehrenfeucht","year":"1979","journal-title":"Information Processing Lett."},{"key":"10.1016\/0304-3975(82)90089-5_BIB4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1080\/00207167908803161","article-title":"Some decidability problems of sentential forms","volume":"7","author":"Harju","year":"1979","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0304-3975(82)90089-5_BIB5","series-title":"Computer Science Technical Report No. 79-CS-7","article-title":"Pure Grammars","author":"Maurer","year":"1979"},{"year":"1973","series-title":"Formal Languages","author":"Salomaa","key":"10.1016\/0304-3975(82)90089-5_BIB6"},{"key":"10.1016\/0304-3975(82)90089-5_BIB7","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/BF00571462","article-title":"On sentential forms of context-free grammars","volume":"2","author":"Salomaaa","year":"1973","journal-title":"Acta Informat."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900895?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900895?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:18:26Z","timestamp":1757477906000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397582900895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,10]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,10]]}},"alternative-id":["0304397582900895"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90089-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1982,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Representation theorems using DOS languages","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(82)90089-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1982 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}