{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T06:45:05Z","timestamp":1771569905714,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0304-3975(03)00244-5","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"1-33","source":"Crossref","is-referenced-by-count":69,"title":["Finite-state dimension"],"prefix":"10.1016","volume":"310","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":"78","reference":[{"key":"10.1016\/S0304-3975(03)00244-5_BIB1","series-title":"Ergodic Theory and Information","author":"Billingsley","year":"1965"},{"key":"10.1016\/S0304-3975(03)00244-5_BIB2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF03019651","article-title":"Sur les probabilit\u00e9s d\u00e9nombrables et leurs applications arithm\u00e9tiques","volume":"27","author":"Borel","year":"1909","journal-title":"Rend. Circ. Mat. Palermo"},{"key":"10.1016\/S0304-3975(03)00244-5_BIB3","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/S0022-0000(05)80073-X","article-title":"On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line","volume":"49","author":"Cai","year":"1994","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/S0304-3975(03)00244-5_BIB4","series-title":"Elements of Information Theory","author":"Cover","year":"1991"},{"key":"10.1016\/S0304-3975(03)00244-5_BIB5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1093\/qmath\/os-20.1.31","article-title":"The fractional dimension of a set defined by decimal properties","volume":"20","author":"Eggleston","year":"1949","journal-title":"Quart. J. Math. Oxford Ser."},{"key":"10.1016\/S0304-3975(03)00244-5_BIB6","series-title":"The Geometry of Fractal Sets","author":"Falconer","year":"1985"},{"key":"10.1016\/S0304-3975(03)00244-5_BIB7","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1109\/18.133269","article-title":"Gambling using a finite state machine","volume":"37","author":"Feder","year":"1991","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(03)00244-5_BIB8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01457179","article-title":"Dimension und \u00e4u\u00dferes Ma\u00df","volume":"79","author":"Hausdorff","year":"1919","journal-title":"Math. Ann."},{"key":"10.1016\/S0304-3975(03)00244-5_BIB9","unstructured":"D.A. Huffman, Canonical forms for information-lossless finite-state logical machines, IRE Trans. Circuit Theory CT-6 (Special Suppl.) 1959, pp. 41\u201359, also available in: E.F. Moore (Ed.), Sequential Machine: Selected Papers, Addison-Wesley, Reading, MA, 1964, pp. 866\u2013871."},{"key":"10.1016\/S0304-3975(03)00244-5_BIB10","first-page":"67","article-title":"A catalog of complexity classes","volume":"Vol. A","author":"Johnson","year":"1990"},{"key":"10.1016\/S0304-3975(03)00244-5_BIB11","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1002\/j.1538-7305.1956.tb03809.x","article-title":"A new interpretation of information rate","volume":"35","author":"Kelley","year":"1956","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0304-3975(03)00244-5_BIB12","series-title":"Switching and Finite Automata Theory","author":"Kohavi","year":"1978"},{"key":"10.1016\/S0304-3975(03)00244-5_BIB13","series-title":"Information-Lossless Automata of Finite Order","author":"Kurmit","year":"1974"},{"key":"10.1016\/S0304-3975(03)00244-5_BIB14","series-title":"Compression and Complexity of Sequences \u201997","first-page":"123","article-title":"A universal upper bound on the performance of the Lempel-Ziv algorithm on maliciously-constructed data","author":"Lathrop","year":"1998"},{"key":"10.1016\/S0304-3975(03)00244-5_BIB15","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","article-title":"Compression of individual sequences via variable rate coding","volume":"24","author":"Lempel","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(03)00244-5_BIB16","doi-asserted-by":"crossref","unstructured":"J.H. Lutz, Dimension in complexity classes, SIAM J. Comput., to appear.","DOI":"10.1109\/CCC.2000.856747"},{"key":"10.1016\/S0304-3975(03)00244-5_BIB17","doi-asserted-by":"crossref","unstructured":"J.H. Lutz, The dimensions of individual strings and sequences, Inform. Comput., to appear.","DOI":"10.1016\/S0890-5401(03)00187-1"},{"key":"10.1016\/S0304-3975(03)00244-5_BIB18","first-page":"170","article-title":"Noiseless coding of combinatorial sources","volume":"22","author":"Ryabko","year":"1986","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/S0304-3975(03)00244-5_BIB19","first-page":"186","article-title":"Algorithmic approach to the prediction problem","volume":"29","author":"Ryabko","year":"1993","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/S0304-3975(03)00244-5_BIB20","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1006\/jcom.1994.1015","article-title":"The complexity and effectiveness of prediction problems","volume":"10","author":"Ryabko","year":"1994","journal-title":"J. Complexity"},{"key":"10.1016\/S0304-3975(03)00244-5_BIB21","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1109\/5.286190","article-title":"On the Lempel\u2013Ziv proof and related topics","volume":"82","author":"Scheinwald","year":"1994","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0304-3975(03)00244-5_BIB22","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF00289514","article-title":"Endliche automaten und zufallsfolgen","volume":"1","author":"Schnorr","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(03)00244-5_BIB23","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0304-3975(03)00244-5_BIB24","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/inco.1993.1017","article-title":"Kolmogorov complexity and Hausdorff dimension","volume":"102","author":"Staiger","year":"1993","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(03)00244-5_BIB25","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s002240000086","article-title":"A tight upper bound on Kolmogorov complexity and uniformly optimal prediction","volume":"31","author":"Staiger","year":"1998","journal-title":"Theory Comput. Systems"},{"key":"10.1016\/S0304-3975(03)00244-5_BIB26","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0304-3975(96)00099-0","article-title":"Normal numbers and sources for BPP","volume":"178","author":"Strauss","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00244-5_BIB27","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1109\/TIT.1978.1055911","article-title":"Coding theorem for individual sequences","volume":"24","author":"Ziv","year":"1978","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503002445?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503002445?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T15:27:01Z","timestamp":1553182021000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503002445"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":27,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0304397503002445"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00244-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}