This reflects the fact that the k-Piecewise Testable languages are the boolean closure of the Strictly k-Piecewise languages.
angluin (1980b) provides necessary and sufficient properties of language classes which are identifiable in the limit from positive data.