This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Billingsley, P., Ergodic Theory and Information. Wiley, New York 1965.
Daley, R.P., The extent and density of sequences within the minimal-program complexity hierarchies. J. Comput. System Sci. 15 (1974), 151–163.
DeLuca, A., On the entropy of a formal language. In: Automata Theory and Formal Languages, Proc. 2nd GI Conference (H. Brakhage, Ed.), Lect. Notes Comput Sci. 33, Springer-Verlag, Berlin 1975, 103–109.
Eilenberg, S., Automata, Languages, and Machines. Vol. A, Academic Press, New York 1974.
Hoogeboom, H.J. and Rozenberg, G., Infinitary languages: Basic theory and applications to concurrent systems. In: Current Trends in Concurrency — Overviews and Tutorials (J.W. de Bakker, W.-P. de Roever and G. Rozenberg, Eds.), Lect. Notes Comput. Sci. 224, Springer-Verlag, Berlin 1986, 266–342.
Katseff, H.P. and Sipser, M., Several results in program size complexity. Theoret. Comput Sci. 15 (1981), 291–309.
Kuich, W., On the entropy of context-free languages. Inform. and Control 16 (1970)2, 173–200.
Leung-Yan-Cheong, S.K. and Cover, T., Some equivalences between Shannon entropy and Kolmogorov complexity. IEEE Trans. Inform. Theory IT-24 (1978), 331–338.
Mi, L., and Vitanyi, P.M.B., Two decades of applied Kolmogorov complexity. In: Proc. 3rd IEEE Structure in Complexity Conference, 1988.
Lindner, R. and Staiger, L., Algebraische Codierungstheorie — Theorie der sequentiellen Codierungen. Akademie-Verlag, Berlin 1977.
Ryabko, B.Ya., Noiseless coding of combinatorial sources, Hausdoff dimension and Kolmogorov complexity. Problemy Peredachi Informatsii 22 (1986) 3, 16–26. [Russian]
Salomaa, A., Theory of Automata. Pergamon, Oxford 1969.
Schnorr, C.P., De Zufälligkeit und Wahrscheinlichkeit. Lect. Notes Math. 218, Springer-Verlag, Berlin 1971.
Schnorr, C.P., Process complexity and effective random tests. J. Comput. System Sci. 7 (1973) 4, 376–388.
Staiger, L., Complexity and entropy. In: Mathematical Foundations of Computer Science (J. Gruska and M. Chytil, Eds.), Lect. Notes Comput. Sci. 118, Springer-Verlag, Berlin 1981, 508–514.
Staiger, L., The entropy of finite-state ω-languages. Probl. Control and Inform. Theory 14 (1985) 5, 383–392.
Staiger, L., Hierarchies of recursive ω-languages. J. Inform. Process. Cybern. EIK 22 (1986) 5/6, 219–241.
Staiger, L., Research in the theory of ω-languages. J. Inform. Process. Cybern. EIK 23 (1987) 8/9, 415–439.
Staiger, L., Ein Satz über die Entropie von Untermonoiden. Theoret. Comput. Sci. 61 (1988) (2,3), 279–282.
Staiger, L., Quadtrees and the Hausdorff dimension of pictures. In: Proc. GEOBILD '89 (A. Hübler, W. Nagel, B.D. Ripley and G. Werner, Eds), Mathematical Research 51, Akademie-Verlag, Berlin 1989
Staiger, L., Combinatorial properties of the Hausdorff dimension. J. Statist. Plann. Inference 22 (1989), to appear.
Thomas, W., Automata on infinite objects. Aachener Informatik-Berichte 88-17.
van Lambalgen, M., Random sequences. Ph.D. Thesis, Univ. of Amsterdam, 1987.
Zvonkin, A.K. and Levin, L.A., Complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Math. Surveys 25 (1970), 83–124.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Staiger, L. (1989). Kolmogorov complexity and Hausdorff dimension. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_42
Download citation
DOI: https://doi.org/10.1007/3-540-51498-8_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51498-5
Online ISBN: 978-3-540-48180-5
eBook Packages: Springer Book Archive