-
Uncommon Suffix Tries
Common assumptions on the source producing the words inserted in a suffix trie with $n$ leaves lead to a $\log n$ height and saturation level. We provide an example of... -
Persistent random walks, variable length Markov chains and piecewise determin...
published in Markov Processes and Related Fields, 19(1) :1-50, 2013. -
Recursion at the crossroads of sequence modeling, random trees, stochastic al...
This monograph synthesizes several studies spanning from dynamical systems in the statistical analysis of sequences, to analysis of algorithms in random trees and...
