5 citations · 7 across the 5 of their papers we have counts for
1 paper · 1 filter
Carlos Gustavo Moreira, Christian Mauduit
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…