{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T15:12:30Z","timestamp":1648998750790},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":4580,"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":[[2001,1]]},"DOI":"10.1016\/s0304-3975(99)00110-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:32:23Z","timestamp":1027607543000},"page":"55-69","source":"Crossref","is-referenced-by-count":1,"title":["Homomorphic characterizations of recursively enumerable languages with very small language classes"],"prefix":"10.1016","volume":"250","author":[{"given":"Satoshi","family":"Okawa","sequence":"first","affiliation":[]},{"given":"Sadaki","family":"Hirose","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00110-3_BIB1","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0019-9958(64)90294-3","article-title":"On a family of linear grammars","volume":"7","author":"Amar","year":"1964","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(99)00110-3_BIB2","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/S0019-9958(65)90275-5","article-title":"Generalizations of regular events","volume":"8","author":"Amar","year":"1965","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(99)00110-3_BIB3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","article-title":"Reversal-bounded multipushdown machines","volume":"8","author":"Baker","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(99)00110-3_BIB4","first-page":"187","article-title":"Context-free grammars and pushdown storage","volume":"65","author":"Chomsky","year":"1962","journal-title":"MIT Res. Lab. Electron. Quart. Prog. Rep."},{"key":"10.1016\/S0304-3975(99)00110-3_BIB5","unstructured":"R. Freund, Gh. P\u0103un, G. Rozenberg, A. Salomaa, Bidirectional sticker systems, 3rd Annual Pacific, Conf. on Biocomputing, Hawaii, 1998, pp. 535\u2013546."},{"key":"10.1016\/S0304-3975(99)00110-3_BIB6","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1145\/321386.321403","article-title":"One-way stack automata","volume":"14","author":"Ginsberg","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00110-3_BIB7","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/S0019-9958(64)90342-0","article-title":"Note on the complement of a (minimal) linear language","volume":"7","author":"Haines","year":"1964","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(99)00110-3_BIB8","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\/S0304-3975(99)00110-3_BIB9","first-page":"30","volume":"22","author":"Okawa","year":"1991","journal-title":"Subclasses of linear context-free languages and homomorphic characterizations of languages Systems Comput. Japan"},{"key":"10.1016\/S0304-3975(99)00110-3_BIB10","series-title":"Jewels of Formal Language Theory","author":"Salomaa","year":"1981"},{"key":"10.1016\/S0304-3975(99)00110-3_BIB11","first-page":"276","article-title":"Finite state representations of context-free languages","volume":"76","author":"Stanley","year":"1964","journal-title":"MIT Res. Lab. Electron. Quart. Prog. Rep."},{"key":"10.1016\/S0304-3975(99)00110-3_BIB12","series-title":"Languages and Machines","author":"Sudkamp","year":"1997"},{"key":"10.1016\/S0304-3975(99)00110-3_BIB13","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0019-9958(80)90741-X","article-title":"The decidability of equivalence for a family of linear grammars","volume":"47","author":"Yehudai","year":"1980","journal-title":"Inform. and Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001103?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001103?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T06:30:51Z","timestamp":1556433051000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["S0304397599001103"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00110-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}