Rauzy complexity and block entropy
\textit{G. Rauzy} [Acta Arith. 29, 211--225 (1976; Zbl 0287.10049)] introduced the functions \(\beta\) and \(\gamma\) from the set of infinite sequences over a finite alphabet to real numbers in the interval \([0,1/2]\) to classify infinite sequences. His first result shows that the sequences with the maximum value of \(\beta\) are exactly the expansions of Borel normal numbers. The second one is that the sequences with the minimum value of \(\beta\), which is 0, are exactly the expansions of numbers that preserve normality when added to a sequence of a Borel normal number.\N\NThe first result of this article characterizes the Rauzy functions in terms of non-aligned block entropy, studied in [\textit{A. Kozachinskiy} and \textit{A. Shen}, J. Comput. Syst. Sci. 118, 75--107 (2021; Zbl 1505.68018)]. The second result proves that the properties Rauzy functions have when they take extreme values (maximum and minimum) also hold for the non-aligned block entropy. The third result shows that the non-aligned block entropy, as a function from infinite sequences to the unit interval, can be expressed as a limit of Shannon conditional entropy.
This page was built for publication: Rauzy complexity and block entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6931984)
