  Some new semantic and syntactic characterizations of the members of the power
pseudovariety $\mathbf{PCS}$ are obtained. This leads in particular to new
algorithms for deciding membership in $\mathbf{PCS}$.
