Journées de Probabilités 2007
Uniqueness without regeneration scheme for chains with unbounded variable length memory
We consider a certain class of unbounded context trees wich have been introduced by D. Maia in her PhD Thesis (March, 2007). D. Maia found a condition wich implies the existence of a regeneration scheme for the stationary process consistent with the tree. Considering the same class of trees, we give a condition wich allows us to keep the uniqueness of the stationary consistent process, without the regeneration scheme.