Nilpotent semigroups are used in various fields of physics to model processes like system decay in quantum mechanics, state transitions in statistical mechanics, and simplifying dynamical systems. They also assist in optimizing control processes. The set of nilpotent matrices forms a semigroup and plays a key role in Jordan decomposition, which has many physical applications. In quantum mechanics, the Jordan form helps analyze linear operators on Hilbert spaces, especially with systems involving eigenvalue multiplicities. In vibration analysis, it aids in studying normal modes of mechanical systems with degenerate frequencies. Additionally, Jordan decomposition simplifies control theory for linear time-invariant systems, stability analysis in dynamical systems, and the behavior of coupled oscillators, as well as solving systems of linear differential equations. Certainly, the semigroup theory has even more applications in theoretical computer science: suffice it to say, for example, that some authors identify semigroups and finite automata. In this paper, we address the problem of P-separability of semigroups with respect to three key predicates: equality-separability, divisibility-separability, and subsemigroup-separability, achieved through homomorphisms into a nilpotent semigroup. We present some significant results that advance the understanding of these concepts.