Set decipherable languages and generators

In this work, we consider a class of languages named ω-set decipherable languages which are very close to the ω-codes. We solve the problem in the restricted case where L is ω-set decipherable and L ∗ is the greatest generator of L ω.