{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:45:54Z","timestamp":1725493554126},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_83","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"1028-1039","source":"Crossref","is-referenced-by-count":3,"title":["Finite-State Dimension"],"prefix":"10.1007","author":[{"given":"Jack J.","family":"Dai","sequence":"first","affiliation":[]},{"given":"James I.","family":"Lathrop","sequence":"additional","affiliation":[]},{"given":"Jack H.","family":"Lutz","sequence":"additional","affiliation":[]},{"given":"Elvira","family":"Mayordomo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"83_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF03019651","volume":"27","author":"Borel","year":"1909","unstructured":"\u00c9. Borel. Sur les probabilit\u00e9s d\u00e9nombrables et leurs applications arithm\u00e9tiques. Rend. Circ. Mat. Palermo, 27:247\u2013271, 1909.","journal-title":"Rend. Circ. Mat. Palermo"},{"key":"83_CR2","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1016\/S0022-0000(05)80073-X","volume":"49","author":"J. Cai","year":"1994","unstructured":"J. Cai and J. Hartmanis. On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line. Journal of Computer and Systems Sciences, 49:605\u2013619, 1994.","journal-title":"Journal of Computer and Systems Sciences"},{"key":"83_CR3","first-page":"31","volume":"20","author":"H.G. Eggleston","year":"1949","unstructured":"H.G. Eggleston. The fractional dimension of a set defined by decimal properties. Quarterly Journal of Mathematics, Oxford Series 20:31\u201336, 1949.","journal-title":"Oxford Series"},{"key":"83_CR4","doi-asserted-by":"crossref","unstructured":"K. Falconer. The Geometry of Fractal Sets. Cambridge University Press, 1985.","DOI":"10.1017\/CBO9780511623738"},{"key":"83_CR5","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1109\/18.133269","volume":"37","author":"M. Feder","year":"1991","unstructured":"M. Feder. Gambling using a finite state machine. IEEE Transactions on Information Theory, 37:1459\u20131461, 1991.","journal-title":"IEEE Transactions on Information Theory"},{"key":"83_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF01457179","volume":"79","author":"F. Hausdorff","year":"1919","unstructured":"F. Hausdorff. Dimension und \u00e4usseres Mass. Math. Ann., 79:157\u2013179, 1919.","journal-title":"Math. Ann."},{"key":"83_CR7","first-page":"41","volume-title":"IRE Trans. Circuit Theory CT-6 (Special Supplement)","author":"D. A. Huffman","year":"1959","unstructured":"D. A. Huffman. Canonical forms for information-lossless finite-state logical machines. IRE Trans. Circuit Theory CT-6 (Special Supplement), pages 41\u201359, 1959. Also avalaible in E.F. Moore (ed.), Sequential Machine: Selected Papers, Addison-Wesley, 1964, pages 866-871."},{"key":"83_CR8","unstructured":"Z. Kohavi. Switching and Finite Automata Theory (Second Edition). McGraw-Hill, 1978."},{"key":"83_CR9","unstructured":"A. A. Kurmit. Information-Lossless Automata of Finite Order. Wiley, 1974."},{"key":"83_CR10","unstructured":"Lathrop and Strauss. A universal upper bound on the performance of the Lempel-Ziv algorithm on maliciously-constructed data. In SEQS: Sequences\u2019 97, 1997."},{"key":"83_CR11","doi-asserted-by":"crossref","unstructured":"J. H. Lutz. Dimension in complexity classes. In Proceedings of the Fifteenth Annual IEEE Conference on Computational Complexity, pages 158\u2013169. IEEE Computer Society Press, 2000.","DOI":"10.1109\/CCC.2000.856747"},{"key":"83_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1007\/3-540-45022-X_76","volume-title":"Proceedings of the 27th Colloquium on Automata, Languages and Programming","author":"J. H. Lutz","year":"2000","unstructured":"J. H. Lutz. Gales and the constructive dimension of individual sequences. In Proceedings of the 27th Colloquium on Automata, Languages and Programming, pages 902\u2013913. Springer Lecture Notes in Computer Science, 2000."},{"key":"83_CR13","first-page":"170","volume":"22","author":"B. Ya. Ryabko","year":"1986","unstructured":"B. Ya. Ryabko. Noiseless coding of combinatorial sources. Problems of Information Transmission, 22:170\u2013179, 1986.","journal-title":"Problems of Information Transmission"},{"key":"83_CR14","first-page":"186","volume":"29","author":"B. Ya. Ryabko","year":"1993","unstructured":"B. Ya. Ryabko. Algorithmic approach to the prediction problem. Problems of Information Transmission, 29:186\u2013193, 1993.","journal-title":"Problems of Information Transmission"},{"key":"83_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1006\/jcom.1994.1015","volume":"10","author":"B. Ya. Ryabko","year":"1994","unstructured":"B. Ya. Ryabko. The complexity and effectiveness of prediction problems. Journal of Complexity, 10:281\u2013295, 1994.","journal-title":"Journal of Complexity"},{"key":"83_CR16","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF00289514","volume":"1","author":"C. P. Schnorr","year":"1972","unstructured":"C. P. Schnorr and H. Stimm. Endliche automaten und zufallsfolgen. Acta Informatica, 1:345\u2013359, 1972.","journal-title":"Acta Informatica"},{"key":"83_CR17","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1017","volume":"102","author":"L. Staiger","year":"1993","unstructured":"L. Staiger. Kolmogorov complexity and Hausdorff dimension. Information and Computation, 102:159\u2013194, 1993.","journal-title":"Information and Computation"},{"key":"83_CR18","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s002240000086","volume":"31","author":"L. Staiger","year":"1998","unstructured":"L. Staiger. A tight upper bound on Kolmogorov complexity and uniformly optimal prediction. Theory of Computing Systems, 31:215\u2013229, 1998.","journal-title":"Theory of Computing Systems"},{"key":"83_CR19","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1109\/TIT.1978.1055911","volume":"24","author":"J. Ziv","year":"1978","unstructured":"J. Ziv. Coding theorem for individual sequences. IEEE Transactions on Information Theory, 24:405\u2013412, 1978.","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_83","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T18:27:13Z","timestamp":1551032833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_83","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}