Characterizing normality via automata and random matrix products

Laurent Bienvenu, Santiago Cifuentes, Hugo Gimbert

For a fixed alphabet A, an infinite sequence X is said to be normal if every word w over A appears in X with the same frequency as any other word of the same length. A classical re…