Some results on codes for generalized factorizations

摘要

This paper is about unique decipherability, according to a control language, for the concatenation of words chosen in different languages. This control language and this Set of languages generate an other language. We give a generalization of the notions of code and stability, and, in the rational case, we also give a polynomial time algorithm to decide if a such generator is a code.