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]
No references recorded for this publication.
No citations of this publication recorded.