Variations on a theme by Weetman Original Research Article

This paper is the second part of a work dealing with two Schützenbergerʹs conjectures on variable-length codes. It contains the detailed proofs of the characterization that we obtained for the degree and the decomposability of finite maximal codes over the alphabet {a, b} with at most 3 occurrences of the letter b in each word.