Conditional Densities of Regular Languages

Authors:
Jakub Kozik
Affiliations:
Jagiellonian University, Institute of Computer Science, ul. Nawojki 11, 30-072 Kraków, Poland
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 2
Cited 1

Generating functionology

Generating functionology
Automata: Theoretic Aspects of Formal Power Series

Automata: Theoretic Aspects of Formal Power Series

Automated grading of DFA constructions

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.