C. Mauduit

activity

20082020

most citedSubstitutions and Möbius disjointness

5 citations · 7 across the 5 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

math.DS2018

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…

math.DS2018

Entropy ratio for infinite sequences with positive entropy

C. Mauduit, C. -G. Moreira

The complexity function of an infinite word $w$ on a finite alphabet $A$ is the sequence counting, for each non-negative $n$ , the number of words of length $n$ on the alphabet $A$ …