  Starting from a Markov chain with a finite alphabet, we consider the chain
obtained when all but one symbol are undistinguishable for the practitioner. We
study necessary and sufficient conditions for this chain to have continuous
transition probabilities with respect to the past.
