Abstract
We establish new sufficient conditions for perfect simulation of chains of infinite order on a countable alphabet. This is done through the introduction of the \emph{localized continuity} assumption. This new assumption, which is formalized with the help of the notion of \emph{context trees}, includes the traditional continuous case, probabilistic context trees and discontinuous kernels. Since our assumptions are more refined than uniform continuity, our algorithms perfectly simulate continuous chains faster than the existing algorithms of the literature. We also give a simple extension of the method allowing to perfectly simulate chains which are neither necessarily continuous nor necessarily weakly non-null.

This publication has 16 references indexed in Scilit: