Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1994: Mathematical Foundations of Computer Science 1994 pp 364–372Cite as

The combinatorial complexity of a finite string

  • Contributions
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 841))

Abstract

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. Comparisons are made between B(x) and K(x), the Kolmogorov complexity of x. A O(n 3) algorithm for computing B(x) is given, along with brief descriptions of experimental results showing the efficacy of this function in practical situations.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Berge, Graphs and Hypergraphs, Dunod, Paris, 1970.

    Google Scholar 

  2. T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley & Sons, Inc., 1991.

    Google Scholar 

  3. D. E. Knuth, The Art of Computer Programming, Volume 2, Seminumerical Algorithms, Addison-Wesley, 1983.

    Google Scholar 

  4. H. Fleischner, Eulerian Graphs and Related Topics, Volume 1, North Holland, Amsterdam, 1990.

    Google Scholar 

  5. H. Fleischner, Eulerian Graphs and Related Topics, Volume 2, North Holland, Amsterdam, 1990.

    Google Scholar 

  6. M. Li and P. M. B. Vitányi, “Kolmogorov Complexity and Its Applications”, in: Handbook of Theoretical Computer Science, Volume A (J. van Leeuwen, ed.), Elsevier/MIT Press, Amsterdam/London, 1990, pp. 187–254.

    Google Scholar 

  7. M. Li and P. M. B. Vitányi, “Combinatorics and Kolmogorov Complexity”, in: Proceedings of the 6th IEEE Conference on Structure in Complexity Theory, 1991, pp. 154–163.

    Google Scholar 

  8. M. Li and P. M. B. Vitányi, An Introduction to Kolmogorov Complexity and Its Applications, Springer-Verlag, 1993.

    Google Scholar 

  9. A. Lempel and J. Ziv, “On the Complexity of Finite Sequences”, IEEE Transactions on Information Theory 22(1) (1976) 75–81.

    Google Scholar 

  10. Guy L. Steele Jr., Common Lisp the Language, Digital Press, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hewlett-Packard Labratories, P.O. Box 8906, 98668, Vancouver, WA, USA

    Felix Frayman

  2. Pacific Bell Telephone Company, Walnut Creek, California, USA

    Valery Kanevsky

  3. San Jose State University, San Jose, California, USA

    Walter Kirchherr

  4. The Silesian University at Opava, Opava, The Czech Republic

    Walter Kirchherr

Authors
  1. Felix Frayman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Valery Kanevsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Walter Kirchherr
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Igor Prívara Branislav Rovan Peter Ruzička

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Frayman, F., Kanevsky, V., Kirchherr, W. (1994). The combinatorial complexity of a finite string. In: Prívara, I., Rovan, B., Ruzička, P. (eds) Mathematical Foundations of Computer Science 1994. MFCS 1994. Lecture Notes in Computer Science, vol 841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58338-6_83

Download citation

  • DOI: https://doi.org/10.1007/3-540-58338-6_83

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58338-7

  • Online ISBN: 978-3-540-48663-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation