Author/Authors :
Naeini, Hojjat Department of Statistics - Islamic Azad University Science and Research Branch, Tehran, Iran , Kazemi, Ramin Department of Statistics - Imam Khomeini International University, Qazvin, Iran , Behzadi, Mohammad Hasan Department of Statistics - Islamic Azad University Science and Research Branch, Tehran, Iran
Abstract :
In this paper, by applying analytic combinatorics, we obtain an asymptotics for the t-th moment of the number of phrases of length l in the Lempel-Ziv parsing algorithms built over a string generated by an asymmetric Bernoulli model. We show that the t-th moment is approximated by its Poisson transform.
Keywords :
Lempel-Ziv parsing algorithm , phrases , digital search tree , mo- ment
