






















We establish diverse relationships between the algorithmic (Kolmogorov) complexity of the prefixes of any binary expansion and $β$-expansions. These relationships allow to develop intuitions on the complexity behavior of $β$-expansions, and raise problems related to compressibility of binary sequences generated in the context of A/D conversion relying on $β$-expansions. Our last contribution is to solve these problems.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。