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
Hajós factorizations and completion of codes
Theoretical Computer Science
Theory of Codes
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Factorizing Codes and Schützenberger Conjectures
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Constructing Finite Maximal Codes from Schützenberger Conjecture
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
An enhanced property of factorizing codes
Theoretical Computer Science - The art of theory
| Hi-index | 0.00 |
In this paper we consider factorizing codes C over A, i.e., codes verifying the factorization conjecture by Schützenberger. Let n be the positive integer such that anεC, we show how we can construct C starting with factorizing codes C' with anεC' and n' , under the hypothesis that all words aizaj in C, with zε(A\a) A*(A\a) ∪ (A\a), satisfy i, j, n. The operation involved, already introduced by Anselmo, is also used to show that all maximal codes C=P (A-1) S+1 with P, SεZ(A) and P or S in Z(a) can be constructed by means of this operation starting with prefix and suffix codes. Old conjectures by Schützenberger have been revised. Copyright 2001 Academic Press.