M. Bodirsky, T. Gärtner, T. Oertzen, and J. Schwinghammer, Effciently computing the density of regular languages, 2004.

P. [. Chauvin, D. Flajolet, B. Gardy, and . Gittenberger, And/Or Trees Revisited, Combinatorics, Probability and Computing, vol.13, issue.4-5, 2004.
DOI : 10.1017/S0963548304006273

]. P. Fla87 and . Flajolet, Analytic models and ambiguity of context-free languages, Theoretical Computer Science, vol.49, 1987.

]. R. Kem80 and . Kemp, A note on the density of inherently ambiguous context-free languages, Acta Inf, vol.14, 1980.

J. Kozik, Conditional Densities of Regular Languages, Electronic Notes in Theoretical Computer Science, vol.140, 2005.
DOI : 10.1016/j.entcs.2005.06.023

J. Kozik, Decidability of the problem of relative density of languages. in prepartion, Man74] Z. Manna. Mathematical Theory of Computation. Mcgraw-Hill Computer Science Series. Mcgraw-Hill College, 1974.

A. Salomaa and M. Soittola, Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science, 1978.

M. Zaionc, On the asymptotic density of tautologies in logic of implication and negation, Reports on Mathematical Logic, vol.39, 2005.