We derive explicit upper bounds for the d-distance between a chain of in nite order and its canonical k-steps Markov approximation. Our proof is entirely construc- tive and involves a \coupling from the past" argument. The new method covers non necessarily continuous probability kernels, and chains with null transition probabilities. These results imply in particular the Bernoulli property for these processes.