{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:26Z","timestamp":1725663266465},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514985"},{"type":"electronic","value":"9783540481805"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51498-8_42","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:01:56Z","timestamp":1330203716000},"page":"434-443","source":"Crossref","is-referenced-by-count":0,"title":["Kolmogorov complexity and Hausdorff dimension"],"prefix":"10.1007","author":[{"given":"Ludwig","family":"Staiger","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"42_CR1","volume-title":"Ergodic Theory and Information","author":"P. Billingsley","year":"1965","unstructured":"Billingsley, P., Ergodic Theory and Information. Wiley, New York 1965."},{"key":"42_CR2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0022-0000(74)80004-8","volume":"15","author":"R. P. Daley","year":"1974","unstructured":"Daley, R.P., The extent and density of sequences within the minimal-program complexity hierarchies. J. Comput. System Sci. 15 (1974), 151\u2013163.","journal-title":"J. Comput. System Sci."},{"key":"42_CR3","series-title":"Lect. Notes Comput Sci.","first-page":"103","volume-title":"Automata Theory and Formal Languages, Proc. 2nd GI Conference","author":"A. DeLuca","year":"1975","unstructured":"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\u2013109."},{"key":"42_CR4","volume-title":"Automata, Languages, and Machines. Vol. A","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S., Automata, Languages, and Machines. Vol. A, Academic Press, New York 1974."},{"key":"42_CR5","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/BFb0027043","volume-title":"Current Trends in Concurrency \u2014 Overviews and Tutorials","author":"H. J. Hoogeboom","year":"1986","unstructured":"Hoogeboom, H.J. and Rozenberg, G., Infinitary languages: Basic theory and applications to concurrent systems. In: Current Trends in Concurrency \u2014 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\u2013342."},{"key":"42_CR6","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(81)90083-9","volume":"15","author":"H. P. Katseff","year":"1981","unstructured":"Katseff, H.P. and Sipser, M., Several results in program size complexity. Theoret. Comput Sci. 15 (1981), 291\u2013309.","journal-title":"Theoret. Comput Sci."},{"issue":"2","key":"42_CR7","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0019-9958(70)90105-1","volume":"16","author":"W. Kuich","year":"1970","unstructured":"Kuich, W., On the entropy of context-free languages. Inform. and Control 16 (1970)2, 173\u2013200.","journal-title":"Inform. and Control"},{"key":"42_CR8","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1109\/TIT.1978.1055891","volume":"IT-24","author":"S. K. Leung-Yan-Cheong","year":"1978","unstructured":"Leung-Yan-Cheong, S.K. and Cover, T., Some equivalences between Shannon entropy and Kolmogorov complexity. IEEE Trans. Inform. Theory IT-24 (1978), 331\u2013338.","journal-title":"IEEE Trans. Inform. Theory"},{"unstructured":"Mi, L., and Vitanyi, P.M.B., Two decades of applied Kolmogorov complexity. In: Proc. 3rd IEEE Structure in Complexity Conference, 1988.","key":"42_CR9"},{"key":"42_CR10","doi-asserted-by":"crossref","DOI":"10.1515\/9783112546369","volume-title":"Algebraische Codierungstheorie \u2014 Theorie der sequentiellen Codierungen","author":"R. Lindner","year":"1977","unstructured":"Lindner, R. and Staiger, L., Algebraische Codierungstheorie \u2014 Theorie der sequentiellen Codierungen. Akademie-Verlag, Berlin 1977."},{"issue":"3","key":"42_CR11","first-page":"16","volume":"22","author":"B. Ya. Ryabko","year":"1986","unstructured":"Ryabko, B.Ya., Noiseless coding of combinatorial sources, Hausdoff dimension and Kolmogorov complexity. Problemy Peredachi Informatsii 22 (1986) 3, 16\u201326. [Russian]","journal-title":"Problemy Peredachi Informatsii"},{"key":"42_CR12","volume-title":"Theory of Automata","author":"A. Salomaa","year":"1969","unstructured":"Salomaa, A., Theory of Automata. Pergamon, Oxford 1969."},{"key":"42_CR13","series-title":"Lect. Notes Math.","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0112458","volume-title":"Zuf\u00e4lligkeit und Wahrscheinlichkeit","author":"C. P. Schnorr","year":"1971","unstructured":"Schnorr, C.P., De Zuf\u00e4lligkeit und Wahrscheinlichkeit. Lect. Notes Math. 218, Springer-Verlag, Berlin 1971."},{"issue":"4","key":"42_CR14","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/S0022-0000(73)80030-3","volume":"7","author":"C. P. Schnorr","year":"1973","unstructured":"Schnorr, C.P., Process complexity and effective random tests. J. Comput. System Sci. 7 (1973) 4, 376\u2013388.","journal-title":"J. Comput. System Sci."},{"key":"42_CR15","first-page":"508","volume-title":"Mathematical Foundations of Computer Science","author":"L. Staiger","year":"1981","unstructured":"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\u2013514."},{"issue":"5","key":"42_CR16","first-page":"383","volume":"14","author":"L. Staiger","year":"1985","unstructured":"Staiger, L., The entropy of finite-state \u03c9-languages. Probl. Control and Inform. Theory 14 (1985) 5, 383\u2013392.","journal-title":"Probl. Control and Inform. Theory"},{"issue":"5\/6","key":"42_CR17","first-page":"219","volume":"22","author":"L. Staiger","year":"1986","unstructured":"Staiger, L., Hierarchies of recursive \u03c9-languages. J. Inform. Process. Cybern. EIK 22 (1986) 5\/6, 219\u2013241.","journal-title":"J. Inform. Process. Cybern. EIK"},{"issue":"8\/9","key":"42_CR18","first-page":"415","volume":"23","author":"L. Staiger","year":"1987","unstructured":"Staiger, L., Research in the theory of \u03c9-languages. J. Inform. Process. Cybern. EIK 23 (1987) 8\/9, 415\u2013439.","journal-title":"J. Inform. Process. Cybern. EIK"},{"issue":"23","key":"42_CR19","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(88)90127-2","volume":"61","author":"L. Staiger","year":"1988","unstructured":"Staiger, L., Ein Satz \u00fcber die Entropie von Untermonoiden. Theoret. Comput. Sci. 61 (1988) (2,3), 279\u2013282.","journal-title":"Theoret. Comput. Sci."},{"key":"42_CR20","volume-title":"Proc. GEOBILD '89","author":"L. Staiger","year":"1989","unstructured":"Staiger, L., Quadtrees and the Hausdorff dimension of pictures. In: Proc. GEOBILD '89 (A. H\u00fcbler, W. Nagel, B.D. Ripley and G. Werner, Eds), Mathematical Research 51, Akademie-Verlag, Berlin 1989"},{"doi-asserted-by":"crossref","unstructured":"Staiger, L., Combinatorial properties of the Hausdorff dimension. J. Statist. Plann. Inference 22 (1989), to appear.","key":"42_CR21","DOI":"10.1016\/0378-3758(89)90042-6"},{"unstructured":"Thomas, W., Automata on infinite objects. Aachener Informatik-Berichte 88-17.","key":"42_CR22"},{"unstructured":"van Lambalgen, M., Random sequences. Ph.D. Thesis, Univ. of Amsterdam, 1987.","key":"42_CR23"},{"key":"42_CR24","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","volume":"25","author":"A. K. Zvonkin","year":"1970","unstructured":"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\u2013124.","journal-title":"Russian Math. Surveys"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51498-8_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T17:58:34Z","timestamp":1687283914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51498-8_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514985","9783540481805"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-51498-8_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}