{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:38:13Z","timestamp":1720201093839},"reference-count":6,"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)90034-9","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"109-112","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["On the Chomsky and Stanley's homomorphic characterization of context-free languages"],"prefix":"10.1016","volume":"36","author":[{"given":"Sadaki","family":"Hirose","sequence":"first","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)90034-9_BIB1","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)90034-9_BIB2","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)90034-9_BIB3","series-title":"The Mathematical Theory of Context-Free Languages","author":"Ginsburg","year":"1966"},{"issue":"2, 3","key":"10.1016\/0304-3975(85)90034-9_BIB4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0304-3975(85)90018-0","article-title":"A homomorphic characterization of recursively enumerable languages","volume":"35","author":"Hirose","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90034-9_BIB5","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/0304-3975(85)90034-9_BIB6","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:0304397585900349?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585900349?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:53:02Z","timestamp":1553187182000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585900349"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":6,"alternative-id":["0304397585900349"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90034-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}