Coding Partitions: Regularity, Maximality and Global Ambiguity
The canonical coding partition of a set of words is the finest partition such that the words contained in at least two factorizations of a same sequence belong to a same class. In the case the set is not uniquely decipherable, it partitions the set into one unambiguous class and other parts that localize the ambiguities in the factorizations of finite sequences.
We firstly prove that the canonical coding partition of a regular set contains a finite number of regular classes. We give an algorithm for computing this partition. We then investigate maximality conditions in a coding partition and we prove, in the regular case, the equivalence between two different notions of maximality. As an application, we finally derive some new properties of maximal uniquely decipherable codes.
Unable to display preview. Download preview PDF.
- 2.Berstel, J., Perrin, D.: Theory of codes, Orlando, FL. Pure and Applied Mathematics, vol. 117. Academic Press Inc, San Diego (1985), http://www-igm.univ-mlv.fr/~berstel/LivreCodes/Codes.html MATHGoogle Scholar
- 3.Burderi, F., Restivo, A.: Coding partitions, Discret. Math. Theor. Comput. Sci (to appear)Google Scholar
- 6.Gönenç, G.: Unique decipherability of codes with constraints with application to syllabification of Turkish words. In: COLING 1973: Computational And Mathematical Linguistics: Proceedings of the International Conference on Computational Linguistics, vol. 1, pp. 183–193 (1973)Google Scholar
- 11.Sakarovitch, J.: Éléments de théorie des automates, Vuibert, Paris. Cambridge University Press, Cambridge (English translation to appear) (2003)Google Scholar