Rauzy dimension and finite-state dimension

TL;DR

This paper explores the relationship between Rauzy's complexity functions and non-aligned block entropies, establishing bounds and characterizations that connect sequence complexity with entropy measures using probabilistic and information-theoretic methods.

Contribution

It provides sharp bounds linking Rauzy's complexity functions to non-aligned block entropies and introduces a probabilistic characterization using Shannon's conditional entropy.

Findings

Sequences with zero upper block entropy have zero Rauzy complexity.

Non-aligned block entropies are essentially subadditive.

Established bounds connect Rauzy's functions with entropy measures.

Abstract

In 1976, Rauzy studied two complexity functions, $\underline{\beta}$ and $\overline{\beta}$, for infinite sequences over a finite alphabet. The function $\underline{\beta}$ achieves its maximum precisely for Borel normal sequences, while $\overline{\beta}$ reaches its minimum for sequences that, when added to any Borel normal sequence, result in another Borel normal sequence. We establish a connection between Rauzy's complexity functions, $\underline{\beta}$ and $\overline{\beta}$, and the notions of non-aligned block entropy, $\underline{h}$ and $\overline{h}$, by providing sharp upper and lower bounds for $\underline{h}$ in terms of $\underline{\beta}$, and sharp upper and lower bounds for $\overline{h}$ in terms of $\overline{\beta}$. We adopt a probabilistic approach by considering an infinite sequence of random variables over a finite alphabet. The proof relies on a new characterization of non-aligned block entropies, $\overline{h}$ and $\underline{h}$, in terms of Shannon's conditional entropy. The bounds imply that sequences with $\overline{h} = 0$ coincide with those for which $\overline{\beta} = 0$. We also show that the non-aligned block entropies, $\underline{h}$ and $\overline{h}$, are essentially subadditive.