A Note on the Lempel-Ziv Parsing Algorithm under Asymmetric Bernoulli‎ ‎Model

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
• moment