Construction de codes factorisants

From MaRDI portal





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^*\).











This page was built for publication: Construction de codes factorisants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1081306)