Rational series and their languages
Rational series and their languages
Construction of a family of finite maximal codes
Theoretical Computer Science
A partial result about the factorization conjecture for finite variable-length codes
Discrete Mathematics
An application of Hajo´s factorizations to variable-length codes
Theoretical Computer Science
Hajós factorizations and completion of codes
Theoretical Computer Science
On some Schützenberger conjectures
Information and Computation
Theory of Codes
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
| Hi-index | 0.00 |
The investigation of the factorizing codes C, i.e., codes satisfying Schützenberger's factorization conjecture, has been carried out from different viewpoints, one of them being the description of structural properties of the words in C. In this framework, we can now improve an already published result. More precisely, given a factorizing code C over a two-letter alphabet A = {a, b}, it was proved by De Felice that the words in the set C1 = C ∩ a*ba* could be arranged over a matrix related to special factorizations of the cyclic groups. We now prove that, in addition, these matrices can be recursively constructed starting with those corresponding to prefix/suffix codes.