Kolmogorov complexity and Hausdorff dimension
Information and Computation
Generalization of automatic sequences for numeration systems on a regular language
Theoretical Computer Science
Hausdorff Dimension in Exponential Time
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Note: fractal dimension and logarithmic loss unpredictability
Theoretical Computer Science
Dimension in Complexity Classes
SIAM Journal on Computing
The dimensions of individual strings and sequences
Information and Computation
Theoretical Computer Science
Effective fractal dimension: foundations and applications
Effective fractal dimension: foundations and applications
Dimension, Entropy Rates, and Compression
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Correspondence Principles for Effective Dimensions
Theory of Computing Systems
Effective Strong Dimension in Algorithmic Information and Computational Complexity
SIAM Journal on Computing
Automatic forcing and genericity: on the diagonalization strength of finite automata
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Theoretical Computer Science
Dimensions of Copeland--Erdös sequences
Information and Computation
Finite-state dimension and real arithmetic
Information and Computation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
A divergence formula for randomness and dimension
Theoretical Computer Science
Theoretical Computer Science
Dimensions of copeland-erdös sequences
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Finite-sate dimension and real arithmetic
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Lempel-ziv dimension for lempel-ziv compression
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Turing's normal numbers: towards randomness
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Note: Normal numbers and finite automata
Theoretical Computer Science
Base invariance of feasible dimension
Information Processing Letters
Functions that preserve p-randomness
Information and Computation
Hi-index | 5.23 |
The effective fractal dimensions at the polynomial-space level and above can all be equivalently defined as the C-entropy rate where C is the class of languages corresponding to the level of effectivization. For example, pspace-dimension is equivalent to the PSPACE-entropy rate.At lower levels of complexity the equivalence proofs break down. In the polynomial-time case, the P-entropy rate is a lower bound on the p-dimension. Equality seems unlikely, but separating the P-entropy rate from p-dimension would require proving P ≠ NP.We show that at the finite-state level, the opposite of the polynomial-time case happens: the REG-entropy rate is an upper bound on the finite-state dimension. We also use the finite-state genericity of Ambos-Spies and Busse [Automatic forcing and genericity: On the diagonalization strength of finit automata, in: Proc. fourth Int. Conf. on Discrete Mathematics and Theoretical Computer Science, 2003, Springer, Berlin, pp. 97-108] to separate finite-state dimension from the REG-entropy rate.However, we point out that a block-entropy rate characterization of finite-state dimension follows from the work of Ziv and Lempel [Compression of individual sequences via variable rate coding, IEEE Trans. Inform. Theory 24 (1978) 530-536] on finite-state compressibility and the compressibility characterization of finite-state dimension by Dai et al. [Finite-state dimension, Theoret. Comput. Sci. 310(1-3) (2004) 1-33].As applications of the REG-entropy rate upper bound and the block-entropy rate characterization, we prove that every regular language has finite-state dimension 0 and that normality is equivalent to finite-state dimension 1.