Construction de codes factorisants (Q1081306): Difference between revisions

Motivated by the factorization conjecture of Schützenberger, we construct all finite maximal codes \(C\subseteq A^*\) which admit a factorization of the form \(C-1=P(A-1)(1+w),\) for some word w and some finite subset P of \(A^*\).