arXiv:math/0009084 Abstract

arXiv:math/0009084 [math.PR]Abstract References Reviews Resources

On the Distribution Function of the Complexity of Finite Sequences

Published 2000-09-08Version 1

Investigations 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.

Comments: 7 pages

Categories: math.PR, math.CO

Subjects: 11Y16, 68Q30, 68Q25

Keywords: finite sequences, complexity, distribution functions depend, important applications, information sources

Related articles: Most relevant | Search more

arXiv:1501.04938 [math.PR] (Published 2015-01-20)

Functional safety: matching the complexity of methods with the complexity of systems

F Brissaud, B Declerck

arXiv:1303.5001 [math.PR] (Published 2013-03-19, updated 2014-10-22)

Measurable events indexed by words

Pandelis Dodos, Vassilis Kanellopoulos, Konstantinos Tyros

arXiv:1111.1352 [math.PR] (Published 2011-11-05, updated 2011-11-08)