Jack J. Dai, James I. Lathrop, Jack H. Lutz, Elvira Mayordomo  Home/Search
Context Related
| webdiis.unizar.es/~elvira/p...fsd.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: webdiis.unizar.es/~elv...research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Classical Hausdor dimension (sometimes called fractal dimension) was recently e ectivized using gales (betting strategies that generalize martingales), thereby endowing various complexity classes with dimension structure and also de ning the constructive dimensions of individual binary (in nite) sequences. In this paper we use gales computed by multi-account nite-state gamblers to develop the nite-state dimensions of sets of binary sequences and individual binary sequences. The theorem of... (Update)
Similar documents based on text: More All
1.1: Finite-State Dimension - Dai, Lathrop, Lutz, Mayordomo (2001) (Correct)
0.5: A Kolmogorov complexity characterization of constructive.. - Mayordomo (2001) (Correct)
0.4: Resource-Bounded Measure Bibliography - Hitchcock (2003) (Correct)
BibTeX entry: (Update)
J. J. Dai, J. I. Lathrop, J. H. Lutz, and E. Mayordomo. Finite-state dimension. In Proceedings of the Twenty-Eighth International Colloquium on Automata, Languages, and Programming, pages 1028-1039. Springer-Verlag, 2001. http://citeseer.ist.psu.edu/dai01finitestate.html More
@article{ dai01finitestate,
author = "Jack J. Dai and James I. Lathrop and Jack H. Lutz and Elvira Mayordomo",
title = "Finite-State Dimension",
journal = "Lecture Notes in Computer Science",
volume = "2076",
pages = "1028--??",
year = "2001",
url = "citeseer.ist.psu.edu/dai01finitestate.html" }
Citations (may not include all citations):2319 Elements of Information Theory (context) - Cover, Thomas - 1991
1447 A mathematical theory of communication (context) - Shannon - 1948
274 A catalog of complexity classes (context) - Johnson - 1990
144 Switching and Finite Automata Theory (context) - Kohavi - 1978
94 The Geometry of Fractal Sets (context) - Falconer - 1985
78 Ergodic Theory and Information (context) - Billingsley - 1965
52 Information and Computation (context) - Lutz, of et al.
49 IEEE Transactions on Information Theory (context) - Ziv, for - 1978
31 Dimension in complexity classes - Lutz - 2000
20 A tight upper bound on Kolmogorov complexity and uniformly o.. (context) - Staiger - 1998
15 Noiseless coding of combinatorial sources (context) - Ya - 1986
15 Algorithmic approach to the prediction problem (context) - Ya - 1993
15 Compression of individual sequences by variable rate coding (context) - Ziv, Lempel - 1978
12 Dimension und ausseres Mass (context) - Hausdor - 1919
10 ectiveness of prediction problems (context) - Ya, complexity - 1994
[Article contains additional citations not shown here]
Documents on the same site (http://webdiis.unizar.es/~elvira/research.html): More
Effective Hausdorff Dimension - Mayordomo (2000) (Correct)
Scaled Dimension and Nonuniform Complexity - Hitchcock, Lutz, Mayordomo (2003) (Correct)
A Kolmogorov complexity characterization of constructive.. - Mayordomo (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC