Showing cs.FLShow all
3 papers · 1 filter
cs.FL2026
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…
cs.FL2026
Efficient Constructions of Finite-State Independent Normal Pairs
Subin Pulari
Finite-state independence is a robust notion of algorithmic independence for infinite words. It was introduced for general infinite words by Becher, Carton, and Heiber via determin…
cs.FL2026
On Normality and Equidistribution for Separator Enumerators
Subin Pulari
A separator is a countable dense subset of , and a separator enumerator is a naming scheme that assigns a real number in to each finite word so that the set of all n…