Exponential inequalities for empirical unbounded context trees

Antonio Galves, Florencia Leonardi

In this paper we obtain non-uniform exponential upper bounds for the rate of convergence of a version of the algorithm Context, when the underlying tree is not necessarily bounded.…