Conditional Densities of Regular Languages
Jakub Kozik · Electronic Notes in Theoretical Computer Science · 2005
We define a density of a given language S in a given language L as an asymptotic probability that a randomly and uniformly chosen word of length n from L belongs to S. There are languages for which densities do not exist. We show that a problem of checking whether one regular language has a density in another regular language is decidable.