Juhani Karhumäki, Aleksi Saarela. The Unique Decipherability in the Monoid of Regular Languages is Undecidable. Fundamenta Informaticae, 110(1-4):197-200, 2011. [doi]
@article{KarhumakiS11-0,
title = {The Unique Decipherability in the Monoid of Regular Languages is Undecidable},
author = {Juhani Karhumäki and Aleksi Saarela},
year = {2011},
doi = {10.3233/FI-2011-537},
url = {http://dx.doi.org/10.3233/FI-2011-537},
researchr = {https://researchr.org/publication/KarhumakiS11-0},
cites = {0},
citedby = {0},
journal = {Fundamenta Informaticae},
volume = {110},
number = {1-4},
pages = {197-200},
}