Refined Bounds on Kolmogorov Complexity for ω-Languages

Authors:
Jöran Mielke
Affiliations:
Institute for Computer Science, Martin--Luther--University, Halle(Saale), Germany
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 2
Cited 2

Kolmogorov complexity and Hausdorff dimension

Information and Computation
An introduction to Kolmogorov complexity and its applications (2nd ed.)

An introduction to Kolmogorov complexity and its applications (2nd ed.)

Constructive dimension and Hausdorff dimension: the case of exact dimension

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
A correspondence principle for exact constructive dimension

CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes

Quantified Score

Hi-index	0.02

Visualization

Abstract

The paper investigates bounds on various notions of complexity for @w-languages. We understand the complexity of an @w-languages as the complexity of the most complex strings contained in it. There have been shown bounds on simple and prefix complexity using fractal Hausdorff dimension. Here these bounds are refined by using general Hausdorff measure originally introduced by Felix Hausdorff. Furthermore a lower bound for a priori complexity is shown.