Showing 2026Show all
2 papers · 1 filter
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…