See this document in CiteSeerX!

Finite-State Dimension (2001)  (Make Corrections)  (5 citations)
Jack J. Dai, James I. Lathrop, Jack H. Lutz, Elvira Mayordomo
Lecture Notes in Computer Science



  Home/Search   Context   Related

 
View or download:
webdiis.unizar.es/~elvira/p...fsd.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  webdiis.unizar.es/~elv...research (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

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)

Context of citations to this paper:   More

...the nite state version of our k = 2 graph in Figure 1. This equivalence follows from the recent proof by Dai, Lathrop, Lutz, and Mayordomo [5] of the equivalence of nite state dimension and nite state compressibility. 2 Preliminaries We work in an arbitrary nite alphabet...

...dimensions. Subsequently, Dai, Lathrop, Lutz, and Mayordomo used gales induced by nite state gamblers to de ne nite state dimension [2]. Fortnow and Lutz [4] also de ned feasible, computable, and nite state predictability. All the results mentioned in this introduction also...

Cited by:   More
Prediction and Dimension - Fortnow, Lutz (2002)   (Correct)
Effective Hausdorff Dimension - Mayordomo (2000)   (Correct)
Effective Dimension Bibliography - Hitchcock   (Correct)

Similar documents (at the sentence level):
63.1%:   Finite-State Dimension - Dai, Lathrop, Lutz, Mayordomo (2001)   (Correct)

Active bibliography (related documents):   More   All
1.0:   The Dimensions of Individual Strings and Sequences - Lutz   (Correct)
0.6:   Effective Strong Dimension, Algorithmic.. - Athreya.. (2004)   (Correct)
0.6:   Effective Fractal Dimensions - Lutz   (Correct)

Similar documents based on text:   More   All
0.5:   A Kolmogorov complexity characterization of constructive.. - Mayordomo (2001)   (Correct)
0.4:   Resource-Bounded Measure Bibliography - Hitchcock (2003)   (Correct)
0.4:   Computational Depth and Reducibility - Juedes, Lathrop, Lutz (1994)   (Correct)

Related documents from co-citation:   More   All
4:   Dimension in complexity classes - Lutz - 2000
3:   Fractal Geometry: Mathematical Foundations and Applications (context) - Falconer - 1990
3:   Noiseless coding of combinatorial sources (context) - Ryabko - 1986

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
9   Information and Computation (context) - Staiger, Hausdor - 1993
6   i and J. Hartmanis. On Hausdor and topological dimensions o.. (context) - Ca - 1994
6   Endliche automaten und zufallsfolgen (context) - Schnorr, Stimm - 1972
5   Gambling using a nite state machine (context) - Feder - 1991
3   The fractional dimension of a set de ned by decimal properti.. (context) - Eggleston - 1949
3   Information-Lossless Automata of Finite Order (context) - Kurmit - 1974
3   Canonical forms for information-lossless nite-state logical .. (context) - Hu - 1959
2   Theoretical Computer Science (context) - Strauss, sources - 1997
2   A universal upper bound on the performance of the LempelZiv .. (context) - Lathrop, Strauss - 1998
2   the Lempel-Ziv proof and related topics (context) - Scheinwald - 1994
1   Sur les probabilites denombrables et leurs applications ar.. (context) - Borel - 1909

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