5 citations · 7 across the 5 of their papers we have counts for
4 papers · 1 filter
An algorithm for the word entropy
Carlos Gustavo Moreira, Christian Mauduit, Sébastien Ferenczi
For any infinite word on a finite alphabet , the complexity function of is the sequence counting, for each non-negative , the number of words of length…
Entropy ratio for infinite sequences with positive entropy
C. Mauduit, C. -G. Moreira
The complexity function of an infinite word on a finite alphabet is the sequence counting, for each non-negative , the number of words of length on the alphabet …
Complexity and fractal dimensions for infinite sequences with positive entropy
Carlos Gustavo Moreira, Christian Mauduit
The complexity function of an infinite word on a finite alphabet is the sequence counting, for each non-negative , the number of words of length on the alphabet …
Substitutions and Möbius disjointness
S. Ferenczi, J. Kułaga-Przymus, M. Lemańczyk +1
We show that Sarnak's conjecture on Möbius disjointness holds for all subshifts given by bijective substitutions and some other similar dynamical systems, e.g.\ those generated by…