The Agafonov and Schnorr-Stimm theorems for probabilistic automata

Laurent Bienvenu, Hugo Gimbert, Subin Pulari

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 cl…