Finite-state dimension

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2076 LNCS, Issue , 2001, Pages 1028-1039

  Dai, Jack J ^a   Lathrop, James I ^b   Lutz, Jack H ^b   Mayordomo, Elvira ^c  

^a IOWA STATE UNIVERSITY   (United States)

^b Iowa State University   (United States)

^c UNIVERSITY OF ZARAGOZA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; BINS; COMPUTATIONAL LINGUISTICS;

BINARY EXPANSIONS; COMPLEXITY CLASS; CONSTRUCTIVE DIMENSION; FINITE-STATE DIMENSION; HAUSDORFF DIMENSION; LOW LEVEL COMPLEXITY; RATIONAL NUMBERS; RATIONAL SEQUENCES;

BINARY SEQUENCES;

EID: 84879526071     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_83     Document Type: Conference Paper

References (19)

1. E. Borel. Sur les probabilit́es d́enombrables et leurs applications arithḿetiques. Rend. Circ. Mat. Palermo, 27:247-271, 1909.
2. J. Cai and J. Hartmanis. On Hausdorff and topological dimensions of the Kol-mogorov complexity of the real line. Journal of Computer and Systems Sciences, 49:605-619, 1994.
3. H. G. Eggleston. The fractional dimension of a set defined by decimal properties. Quarterly Journal of Mathematics, Oxford Series 20:31-36, 1949.
4. K. Falconer. The Geometry of Fractal Sets. Cambridge University Press, 1985.
5. M. Feder. Gambling using a finite state machine. IEEE Transactions on Information Theory, 37:1459-1461, 1991.
6. F. Hausdorff. Dimension und ̈ausseres Mass. Math. Ann. , 79:157-179, 1919.
7. D. A. Huffman. Canonical forms for information-lossless finite-state logical machines. IRE Trans. Circuit Theory CT-6 (Special Supplement), pages 41-59, 1959. Also avalaible in E. F. Moore (ed. ), Sequential Machine: Selected Papers, Addison-Wesley, 1964, pages 866-871.
8. Z. Kohavi. Switching and Finite Automata Theory (Second Edition). McGraw-Hill, 1978.
9. A. A. Kurmit. Information-Lossless Automata of Finite Order. Wiley, 1974.
10. Lathrop and Strauss. A universal upper bound on the performance of the Lempel-Ziv algorithm on maliciously-constructed data. In SEQS: Sequences '97, 1997.
11. J. H. Lutz. Dimension in complexity classes. In Proceedings of the Fifteenth Annual IEEE Conference on Computational Complexity, pages 158-169. IEEE Computer Society Press, 2000.
12. J. H. Lutz. Gales and the constructive dimension of individual sequences. In Proceedings of the 27th Colloquium on Automata, Languages and Programming, pages 902-913. Springer Lecture Notes in Computer Science, 2000.
13. B. Ya. Ryabko. Noiseless coding of combinatorial sources. Problems of Information Transmission, 22:170-179, 1986.
14. B. Y. Ryabko. Algorithmic approach to the prediction problem. Problems of Information Transmission, 29:186-193, 1993.
15. B. Y. Ryabko. The complexity and effectiveness of prediction problems. Journal of Complexity, 10:281-295, 1994.
16. C. P. Schnorr and H. Stimm. Endliche automaten und zufallsfolgen. Acta Infor-matica, 1:345-359, 1972.
17. L. Staiger. Kolmogorov complexity and Hausdorff dimension. Information and Computation, 102:159-194, 1993.
18. L. Staiger. A tight upper bound on Kolmogorov complexity and uniformly optimal prediction. Theory of Computing Systems, 31:215-229, 1998.
19. J. Ziv. Coding theorem for individual sequences. IEEE Transactions on Information Theory, 24:405-412, 1978.