On the Complexity of Finite Sequences

@article{Lempel1976OnTC,
  title={On the Complexity of Finite Sequences},
  author={A. Lempel and J. Ziv},
  journal={IEEE Trans. Inf. Theory},
  year={1976},
  volume={22},
  pages={75-81}
}
  • A. Lempel, J. Ziv
  • Published 1976
  • Mathematics, Computer Science
  • 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… Expand
2,090 Citations
On complexity of finite sequences
  • 20
On the distribution function of the complexity of finite sequences
  • Highly Influenced
  • PDF
The Combinatorial Complexity of a Finite String
  • 1
On the Complexities of de Bruijn Sequences
  • 108
Some Computable Complexity Measures for Binary Sequences
  • 73
Relationship among Complexities of Individual Sequences over Countable Alphabet
  • S. Kuzuoka, T. Uyematsu
  • Mathematics, Computer Science
  • IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
  • 2006
  • PDF
Physical complexity of symbolic sequences
  • 143
  • PDF
Complexity of strings in the class of Markov sources
  • J. Rissanen
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 1986
  • 197
...
1
2
3
4
5
...

References

SHOWING 1-5 OF 5 REFERENCES
Process complexity and effective random tests
  • 225
  • PDF
The Definition of Random Sequences
  • 1,146
  • PDF
Information-Theoretic Limitations of Formal Systems
  • 205
  • PDF