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]

Authors

Juhani Karhumäki

This author has not been identified. Look up 'Juhani Karhumäki' in Google

Aleksi Saarela

This author has not been identified. Look up 'Aleksi Saarela' in Google