Showing 2025Show all
2 papers · 1 filter
cs.IT2025
A Markov-Chain Characterization of Finite-State Dimension and a Generalization of Agafonov's Theorem
Laurent Bienvenu, Hugo Gimbert, Subin Pulari
Finite-state dimension quantifies the asymptotic rate of information in an infinite sequence as perceived by finite automata. For a fixed alphabet, the infinite sequences that have…
cs.FL2025
The Agafonov and Schnorr-Stimm theorems for probabilistic automata
Laurent Bienvenu, Hugo Gimbert, Subin Pulari
For a fixed alphabet , an infinite sequence is said to be normal if every word over appears in with the same frequency as any other word of the same length. A cl…