Unique decipherability in formal languages

We consider several language-theoretic aspects of various notions of unique decipherability (or unique factorization) in formal languages. Given a language L at some position within the Chomsky hierarchy, we investigate the language of words UD ( L ) in L ⁎ that have unique factorization over L. We also consider similar notions for weaker forms of unique decipherability, such as numerically decipherable words ND ( L ), multiset decipherable words MSD ( L ) and set decipherable words SD ( L ). Although these notions of unique factorization have been considered before, it appears that the languages of words having these properties have not been positioned in the Chomsky hierarchy up until now. We show that UD ( L ), ND ( L ), MSD ( L ) and SD ( L ) need not be context-free if L is context-free. In fact ND ( L ) and MSD ( L ) need not be context-free even if L is finite, although UD ( L ) and SD ( L ) are regular in this case. We show that if L is context-sensitive, then so are UD ( L ), ND ( L ), MSD ( L ) and SD ( L ). We also prove that the membership problem (resp. , emptiness problem) for these classes is PSPACE-complete (resp. , undecidable). We finally determine upper and lower bounds on the length of the shortest word of L ⁎ not having the various forms of unique decipherability into elements of L.

Authors

• Paul C. Bell
• Daniel Reidenbach
• Jeffrey O. Shallit

Keywords

• Codes
• Unique decipherability
• Numerical decipherability
• Set decipherability
• Multiset decipherability