{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T19:40:32Z","timestamp":1767901232787,"version":"3.49.0"},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1978,10,1]],"date-time":"1978-10-01T00:00:00Z","timestamp":276048000000},"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":12708,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1978,10]]},"DOI":"10.1016\/0022-0000(78)90002-8","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"163-175","source":"Crossref","is-referenced-by-count":59,"title":["On the decidability of homomorphism equivalence for languages"],"prefix":"10.1016","volume":"17","author":[{"suffix":"II","given":"K.","family":"Culik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arto","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(78)90002-8_BIB1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0304-3975(76)90066-9","article-title":"On the decidability of the sequence equivalence problem for DOL-systems","volume":"3","author":"Culik","year":"1977","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/0022-0000(78)90002-8_BIB2","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/S0019-9958(77)90512-5","article-title":"The decidability of the equivalence problem for DOL-systems","volume":"35","author":"Culik","year":"1977","journal-title":"Inform. Contr."},{"key":"10.1016\/0022-0000(78)90002-8_BIB3","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/S0019-9958(74)90857-2","article-title":"On the decidability of some equivalence problems for DOL-systems","volume":"25","author":"Nielsen","year":"1974","journal-title":"Inform. Contr."},{"key":"10.1016\/0022-0000(78)90002-8_BIB4","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/0022-0000(78)90002-8_BIB5","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/BF00571462","article-title":"On sentential forms of context-free grammars","volume":"2","author":"Salomaa","year":"1973","journal-title":"Acta Inform."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000078900028?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000078900028?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:28:31Z","timestamp":1550305711000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000078900028"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,10]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1978,10]]}},"alternative-id":["0022000078900028"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(78)90002-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1978,10]]}}}