On the Complexity of Finite Sequences

  title={On the Complexity of Finite Sequences},
  author={Abraham Lempel and Jacob Ziv},
  journal={IEEE Trans. Inf. Theory},
A new approach to the problem of evaluating the complexity ("randomness") of finite sequences is presented. The proposed complexity measure is related to the number of steps in a self-delimiting production process by which a given sequence is presumed to be generated. It is further related to the number of distinct substrings and the rate of their occurrence along the sequence. The derived properties of the proposed measure are discussed and motivated in conjunction with other well-established… 
On complexity of finite sequences
A possible definition of complexity of finite pattern is proposed, under which the complexity of random strings is very small, while the aperiodic string with strong random correlation between symbols has maximum complexity.
On the distribution function of the complexity of finite sequences
The Combinatorial Complexity of a Finite String
A function, B(x) is introduced which assigns a real number to a string, x, which is intended to be a measure of the randomness of x, the Kolmogorov complexity of x.
On the Complexities of de Bruijn Sequences
Relationship among Complexities of Individual Sequences over Countable Alphabet
It is shown that two kinds of empirical entropies and the self-entropy rate regarding a Markov source are asymptotically equal and lower bounded by the maximum number of phrases in distinct parsing of the sequence.
Some Computable Complexity Measures for Binary Sequences
This paper will focus on complexity measures that are not only of theoretical interest, but that can also be obtained in an algorithmic manner, such as the linear complexity, thelinear complexity profile, and the tree complexity.
A test for randomness based on a complexity measure
The results show that the test is sensitive to a variety of alternatives to randomness and suggest that the proposed test statistic is a reasonable measure of the stochastic complexity of a finite sequence of discrete random variables.
Physical complexity of symbolic sequences
The complexity of DNA sequences. Different approaches and definitions
DNA sequences are the subject of special attention, due to the importance of the object, manifestations of repetition of different types, and numerous examples of using the concept of complexity in solving problems of classification and evolution of various biological objects.
Complexity of strings in the class of Markov sources
  • J. Rissanen
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1986
Shannon's self-information of a string is generalized to its complexity relative to the class of finite-state-machine (FSM) defined sources by a theorem stating that, asymptotically, the mean complexity provides a tight lower bound for the mean length of all so-called regular codes.


The Definition of Random Sequences
Information-Theoretic Limitations of Formal Systems
An attempt is made to apply information-theoretic computational complexity to meta-mathematics by measuring the difficulty of proving a given set of theorems, in terms of the number of bits of axioms that are assumed, and the size of the proofs needed to deduce the theoremic proofs.