F. Bassino, J. David, and C. Nicaud, On the average complexity of Moore's state minimization algorithm, 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009) Leibniz International Proceedings in Informatics (LIPIcs), pp.123-134, 2009.

P. Berenbrink and T. Sauerwald, The Weighted Coupon Collector???s Problem and Applications, 15th International Computing and Combinatorics Conference, 2009.
DOI : 10.1016/0166-218X(92)90177-C

O. Bodini and Y. Ponty, Multi-dimensional Boltzmann sampling of languages, Proceedings of AOFA, 2010.

S. Brlek, E. Pergola, and O. Roques, Non uniform random generation of generalized Motzkin paths, Acta Informatica, vol.16, issue.4, pp.603-616, 2006.
DOI : 10.1007/s00236-006-0008-x

B. Canou and A. Darrasse, Fast and sound random generation for automated testing and benchmarking in objective Caml, ML '09: Proceedings of the, ACM SIGPLAN workshop on ML, pp.61-70, 2009.

A. Denise, M. Gaudel, S. Gouraud, R. Lassaigne, and S. Peyronnet, Uniform random sampling of traces in very large models, Proceedings of the 1st international workshop on Random testing , RT '06, pp.10-19, 2006.
DOI : 10.1145/1145735.1145738
URL : https://hal.archives-ouvertes.fr/hal-00080471

A. Denise, O. Roques, and M. Termier, Random generation of words of context-free languagesaccording to the frequencies of letters, Trends in Mathematics, Birkhaüser, pp.113-125, 2000.

Y. Ding, C. Y. Chan, and C. E. Lawrence, RNA secondary structure prediction by centroids in a Boltzmann weighted ensemble, RNA, vol.11, issue.8, pp.1157-1166, 2005.
DOI : 10.1261/rna.2500605

Y. Ding and E. Lawrence, A statistical sampling algorithm for RNA secondary structure prediction, Nucleic Acids Research, vol.31, issue.24, pp.7280-7301, 2003.
DOI : 10.1093/nar/gkg938

M. Drmota, Systems of functional equations, Random Struct, Alg, vol.10, pp.103-124, 1997.

P. Duchon, P. Flajolet, G. Louchard, and G. Schaeffer, Random generation of combinatorial structures: Boltzmann samplers and beyond, Proceedings of the 2011 Winter Simulation Conference (WSC), pp.577-625, 2004.
DOI : 10.1109/WSC.2011.6147745
URL : https://hal.archives-ouvertes.fr/hal-00654267

P. Flajolet, Analytic models and ambiguity of context-free languages, Theoretical Computer Science, vol.49, issue.2-3, pp.283-309, 1987.
DOI : 10.1016/0304-3975(87)90011-9
URL : https://hal.archives-ouvertes.fr/inria-00076071

P. Flajolet, D. Gardy, and L. Thimonier, Birthday paradox, coupon collectors, caching algorithms and self-organizing search, Discrete Applied Mathematics, vol.39, issue.3, pp.207-229, 1992.
DOI : 10.1016/0166-218X(92)90177-C
URL : https://hal.archives-ouvertes.fr/inria-00075832

P. Flajolet and R. Sedgewick, Analytic combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

P. Flajolet, P. Zimmermann, and B. , A calculus for the random generation of labelled combinatorial structures, Theoretical Computer Science, vol.132, issue.1-2, pp.1-35, 1994.
DOI : 10.1016/0304-3975(94)90226-7
URL : https://hal.archives-ouvertes.fr/hal-00917729

D. Gardy, Occupancy urn models in the analysis of algorithms, Journal of Statistical Planning and Inference, vol.101, issue.1-2, pp.95-105, 2002.
DOI : 10.1016/S0378-3758(01)00156-2

H. Hwang and S. Janson, Local limit theorems for finite and infinite urn models, The Annals of Probability, vol.36, issue.3, pp.992-1022, 2008.
DOI : 10.1214/07-AOP350

J. S. Mccaskill, The equilibrium partition function and base pair binding probabilities for RNA secondary structure, Biopolymers, vol.24, issue.6-7, pp.1105-1119, 1990.
DOI : 10.1002/bip.360290621

R. Nussinov and A. B. Jacobson, Fast algorithm for predicting the secondary structure of single-stranded RNA., Proceedings of the National Academy of Sciences, vol.77, issue.11, pp.6903-6916, 1980.
DOI : 10.1073/pnas.77.11.6309

Y. Ponty, Non-redundant random generation from weighted context-free languages, Proceedings of GASCOM'08, p.10, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00548877

Y. Ponty, M. Termier, and A. Denise, GenRGenS: software for generating random genomic sequences and structures, Bioinformatics, vol.22, issue.12, pp.1534-1535, 2006.
DOI : 10.1093/bioinformatics/btl113
URL : https://hal.archives-ouvertes.fr/inria-00548871

M. Vauchaussade-de-chaumont and G. Viennot, Polynômes orthogonaux etprobì emes d'´ enumération en biologie moléculaire, 1983.

M. S. Waterman, Secondary structure of single stranded nucleic acids, Advances in Mathematics Supplementary Studies, vol.1, issue.1, pp.167-212, 1978.

H. S. Wilf, A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects, Advances in Mathematics, vol.24, issue.2, pp.281-291, 1977.
DOI : 10.1016/S0001-8708(77)80046-7

M. Zuker and P. Stiegler, Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information, Nucleic Acids Research, vol.9, issue.1, pp.133-148, 1981.
DOI : 10.1093/nar/9.1.133