An algorithm for the word entropy

Carlos Gustavo Moreira, Christian Mauduit, Sébastien Ferenczi

For any infinite word $w$ on a finite alphabet $A$, the complexity function $p_w$ of $w$ is the sequence counting, for each non-negative $n$, the number $p_w(n)$ of words of length…