The Unique Decipherability in the Monoid of Regular Languages is Undecidable

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]

Abstract

Abstract is missing.