The degree of a finite set of words

We prove several results concerning finitely generated submonoids of the free monoid. These results generalize those known for free submonoids. We prove in particular that if $X=Y\circ Z$ is a composition of finite sets of words with $Y$ complete, then $d(X)\le d(Y)d(Z)$.