On the Distribution Function of the Complexity of Finite Sequences

Simple item page
dc.creatorSzczepanski, Janusz
dc.date2000-09-08
dc.date.accessioned2026-07-07T04:37:17Z
dc.date.available2026-07-07T04:37:17Z
dc.descriptionInvestigations of complexity of sequences lead to important applications such as effective data compression, testing of randomness, discriminating between information sources and many others. In this paper we establish formulas describing the distribution functions of random variables representing the complexity of finite sequences introduced by Lempel and Ziv in 1976. We show that the distribution functions depend in an affine way on the probabilities of the so called "exact" sequences.
dc.description7 pages
dc.identifierhttps://arxiv.org/abs/math/0009084
dc.identifierhttp://arxiv.org/abs/math/0009084
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/59896
dc.subjectProbability
dc.subjectCombinatorics
dc.subject11Y16, 68Q30, 68Q25
dc.titleOn the Distribution Function of the Complexity of Finite Sequences
dc.typetext

Files

Collections

arXiv