Generalized factorizations of words and their algorithmic properties
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
Theory of Codes
COLING '73 Proceedings of the 5th conference on Computational linguistics - Volume 1
Codes, unambiguous automata and sofic systems
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
| Hi-index | 0.00 |
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.