Effective Dimensions and Relative Frequencies

Consider the problem of calculating the fractal dimension of a set X consisting of all infinite sequences S over a finite alphabet that satisfy some given condition P on the asymptotic frequencies with which various symbols from appear in S. Solutions to this problem are known in cases where (i) the fractal dimension is classical (Hausdorff or packing dimension), or (ii) the fractal dimension is effective (even finite-state) and the condition P completely specifies an empirical distribution over , i.e., a limiting frequency of occurrence for every symbol in . In this paper we show how to calculate the finite-state dimension (equivalently, the finite-state compressibility) of such a set X when the condition P only imposes partial constraints on the limiting frequencies of symbols. Our results automatically extend to less restrictive effective fractal dimensions (e.g., polynomial-time, computable, and constructive dimensions), and they have the classical results (i) as immediate coroll...

• Type: Conference
• Year: 2008
• Where: CIE
• Authors: Xiaoyang Gu, Jack H. Lutz
• Keywords: Applied Computing, CIE 2008, Finite-state Dimension, Fractal Dimensions, Packing Dimension