On the redundancy of HMM patterns
Anand K. Dhulipala, Alon Orlitsky · 2004
In this paper the pattern redundancy of strings generated by hidden Markov models is bounded over unknown, possibly infinite alphabets, showing in particular that it diminishes to zero when the number of states is sufficiently small.