Abstract
Primitive words play very important role in the formal language theory for their elementary combinatorial properties. Analogous to primitive words, we consider prefix n-primitive words. Prefix n-primitivities are applied to check whether a neural network converges for a set of data. In this note we continue our previous work to characterize any two distinct words u and v such that the catenation uv 2 is prefix n-primitive whenever u is p-primitive.