Synchronization and decomposability for a family of codes. II (Q1893165)

The main result is that, for any variable length code \(C\) on a two letter alphabet \(\{a, b\}\), such that \(C\) is maximal and finite and has at most 3 occurrences of \(b\) in each of its elements, \(C\) has always one or two factorizations; if \(C\) has degree 1, it has one factorization; if \(C\) has degree 2 or 3 it has two factorizations and they may be deduced from the precise form of \(C\) given by the authors, which is related to Krasner factorizations.