\input zb-basic
\input zb-ioport
\iteman{io-port 02044502}
\itemau{Anselmo, Marcella}
\itemti{Constructing finite maximal codes from Sch\"utzenberger conjecture.}
\itemso{Restivo, Antonio (ed.) et al., Theoretical computer science. 7th Italian conference, ICTCS 2001, Torino, Italy, October 4--6, 2001. Proceedings. Berlin: Springer (ISBN 3-540-42672-8). Lect. Notes Comput. Sci. 2202, 197-214 (2001).}
\itemab
Summary: The Sch\"utzenberger Conjecture claims that any finite maximal code $C$ is factorizing, i.e. $SC^*P=A^*$ in a non-ambiguous way, for some $S,P$. Let us suppose that the Sch\"utzenberger Conjecture holds. Two problems arise: the construction of all $(S,P)$ and the construction of $C$ starting from $(S,P)$. Regarding the first problem we consider two families of possible languages $S$: $S$ prefix-closed and $S$ s.t. $S\setminus \{1\}$ is a code. For the second problem we present a method of constructing $C$ from $(S,P)$ that relies on the construction of right- and left-factors of a language. Results are based on a combinatorial characterization of right- and left- factorizing languages.
\itemrv{~}
\itemcc{}
\itemut{}
\itemli{http://link.springer.de/link/service/series/0558/bibs/2202/22020197.htm}
\end