Not every domain of a plain decompressor contains the domain of a prefix-free one

DOI10.1016/J.TCS.2010.10.012zbMath1206.68153arXiv1001.4462OpenAlexW1687831583WikidataQ57349567 ScholiaQ57349567MaRDI QIDQ620966

Ilya Razenshteyn, Mikhail Andreev, Alexander Shen

Publication date: 2 February 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1001.4462

zbMATH Keywords

optimal decompressorplain Kolmogorov complexityprefix Kolmogorov complexityprefix-free decompressor

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (1)

Universal recursively enumerable sets of strings

Cites Work

• Universal Recursively Enumerable Sets of Strings

This page was built for publication: Not every domain of a plain decompressor contains the domain of a prefix-free one