{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:38:31Z","timestamp":1742384311228},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/0304-3975(85)90018-0","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"261-269","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["A homomorphic characterization of recursively enumerable languages"],"prefix":"10.1016","volume":"35","author":[{"given":"Sadaki","family":"Hirose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoshi","family":"Okawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaaki","family":"Yoneda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90018-0_BIB1","series-title":"Transductions and Context-Free Languages","author":"Berstel","year":"1979"},{"key":"10.1016\/0304-3975(85)90018-0_BIB2","first-page":"187","article-title":"Context-free grammars and pushdown storage","volume":"65","author":"Chomsky","year":"1962","journal-title":"M.I.T. Res. Lab. Electron. Quart. Prog. Report"},{"key":"10.1016\/0304-3975(85)90018-0_BIB3","series-title":"Computer Programming and Formal Systems","first-page":"118","article-title":"The algebraic theory of context-free languages","author":"Chomsky","year":"1962"},{"key":"10.1016\/0304-3975(85)90018-0_BIB4","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/322123.322136","article-title":"A purely homomorphic characterization of recursively enumerabl sets","volume":"26","author":"Culik","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(85)90018-0_BIB5","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/322203.322211","article-title":"Fixed point languages, equality languages and representation of recursively enumerable languages","volume":"27","author":"Engelfriet","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(85)90018-0_BIB6","series-title":"The Mathematical Theory of Context-Free Languages","author":"Ginsburg","year":"1966"},{"key":"10.1016\/0304-3975(85)90018-0_BIB7","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1145\/321386.321403","article-title":"One-way stack automata","volume":"14","author":"Ginsburg","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(85)90018-0_BIB8","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0304-3975(85)90018-0_BIB9","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/S0019-9958(81)90170-4","article-title":"Left universal context-free grammars and homomorphic characterizations of languages","volume":"50","author":"Hirose","year":"1981","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(85)90018-0_BIB10","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/S0019-9958(75)90216-8","article-title":"A universal context-free grammar","volume":"28","author":"Kasai","year":"1975","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(85)90018-0_BIB11","series-title":"Jewels of Formal Language Theory","author":"Salomaa","year":"1981"},{"key":"10.1016\/0304-3975(85)90018-0_BIB12","first-page":"276","article-title":"Finite state representations of context-free languages","volume":"76","author":"Stanley","year":"1965","journal-title":"M.I.T. Res. Lab. Electron. Quart. Prog. Report"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585900180?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585900180?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T16:52:46Z","timestamp":1553187166000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585900180"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":12,"alternative-id":["0304397585900180"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90018-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}