This paper defines Strictly k-Piecewise (SP k ) distributions and shows how they too can be efficiently estimated from positive data.
with the Markov assumption, our assumption is that the probability of the next symbol is conditioned on the previous set of discontiguous subsequences of length k − 1 in the string.