Prefix-Free and prefix-correct complexities with compound conditions

Authors:
Elena Kalinina
Affiliations:
Department of Mechanics and Mathematics, Moscow State University, Russia
Venue:
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Year:
2010

Citing 3
Cited 0

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

An introduction to Kolmogorov complexity and its applications (2nd ed.)
A Theory of Program Size Formally Identical to Information Theory

Journal of the ACM (JACM)
Logical operations and Kolmogorov complexity

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we compare two types of conditional prefix complexity assuming that conditions are sets of strings rather than [4] strings. We show that prefix-free and prefix-correct versions of the definition are essentially different.