A word w is said to be a primitive word if it cannot be expressed as a power of any other word. A language L consisting of non-empty words is called -reducible if there exists a non-empty word w such that Lw contains only finitely many powers of each primitive word. We show that every regular component, context-free component, local language and every regular language containing no primitive words are -reducible. Languages which are not -reducible are investigated and characterized. We show that every code is -reducible. But there are 2-codes which are not -reducible. The -annihilator of a language L is the set of all non-empty words w such that Lw contains only finitely many powers of each primitive word. This paper also concerns the properties of the -annihilators of languages. The -annihilators of 2-codes and some other languages are investigated and characterized in this paper. The results provide an outline of the relationship between the catenation of languages and the powers of primitive words.
