A complete sufficient statistic for finite-state Markov processes with application to source coding

A complete sufficient statistic is presented for the class of all finite-state, finite-order stationary discrete Markov processes. This sufficient statistic is complete in the sense that it summarizes in entirety the whole of the relevant information supplied by any process sample. The sufficient statistic has application to source coding problems such as source matching and calculation of the rate distortion function. >