{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:32:40Z","timestamp":1777645960252,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1-4","license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2011,6]]},"abstract":"<jats:p>We show by a simple reduction that the unique decipherability problem in the language monoid of regular languages over a non-unary alphabet is undecidable.<\/jats:p>","DOI":"10.3233\/fi-2011-537","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T23:44:43Z","timestamp":1575330283000},"page":"197-200","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["The Unique Decipherability in the Monoid of Regular Languages is Undecidable"],"prefix":"10.1177","volume":"110","author":[{"given":"Juhani","family":"Karhum\u00e4ki","sequence":"first","affiliation":[{"name":"Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, FI-20014 Turku, Finland. {karhumak,amsaar}@utu.fi"}]},{"given":"Aleksi","family":"Saarela","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, FI-20014 Turku, Finland. {karhumak,amsaar}@utu.fi"}]}],"member":"179","published-online":{"date-parts":[[2011,1,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2011-537","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2011-537","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:33:54Z","timestamp":1777444434000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2011-537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,1]]},"references-count":0,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["10.3233\/FI-2011-537"],"URL":"https:\/\/doi.org\/10.3233\/fi-2011-537","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,1]]}}}