O. [. Bernardi and . Giménez, A Linear Algorithm for the Random Sampling from??Regular Languages, Algorithmica, vol.8, issue.1, pp.130-145
DOI : 10.1007/s00453-010-9446-5

G. [. Bergeron, P. Labelle, and . Leroux, Combinatorial species and tree-like structures, 1998.
DOI : 10.1017/CBO9781107325913

O. Bodini, O. Roussel, and M. Soria, Boltzmann samplers for first-order differential specifications . Special issue of, Discrete Applied Mathematics ? LAGOS 09, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00641072

]. A. Den94 and . Denise, Méthodes de génération aléatoire d'objets combinatoires de grande taille etprobì emes d'´ enumération, 1994.

]. L. Dev86 and . Devroye, Non-uniform random variate generation, 1986.

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.4-5577, 2004.
DOI : 10.1109/WSC.2011.6147745

URL : https://hal.archives-ouvertes.fr/hal-00654267

]. A. Dgg-+-06, M. C. Denise, S. D. Gaudel, R. Gouraud, S. Lassaigne et al., Uniform random sampling of traces in very large models, Proceedings of the 1st international workshop on Random testing, pp.10-19, 2006.

K. [. Darrasse, O. Panagiotou, M. Roussel, and . Soria, Boltzmann generation for regular languages with shuffle, Conference GASCom 2010, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00548898

P. [. Denise and . Zimmermann, Uniform random generation of decomposable structures using floating-point arithmetic, Theoretical Computer Science, vol.218, issue.2, pp.233-248, 1999.
DOI : 10.1016/S0304-3975(98)00323-5

URL : https://hal.archives-ouvertes.fr/inria-00073447

]. S. Eil74 and . Eilenberg, Automata, languages and machines, volume A. Academic press, 1974.

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

R. [. Flajolet and . Sedgewick, Analytic combinatorics, 2008.
DOI : 10.1017/CBO9780511801655

URL : https://hal.archives-ouvertes.fr/inria-00072739

P. [. Flajolet, B. Zimmerman, and . Van-cutsem, 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

M. [. Mishna and . Zabrocki, Analytic aspects of the shuffle product, 25th International Symposium on Theoretical Aspects of Computer Science Schloss Dagstuhl ? Leibniz-Zentrum für Informatik, pp.561-572, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00255817

C. Pivoteau, B. Salvy, and M. Soria, Boltzmann oracle for combinatorial systems In Algorithms, Trees, Combinatorics and Probabilities, Proceedings of the Fifth Colloquium on Mathematics and Computer Science, pp.475-488, 2008.

M. [. Roussel and . Soria, Boltzmann sampling of ordered structures, LAGOS'09 -V Latin-American Algorithms, Graphs and Optimization Symposium, pp.305-310, 2009.
DOI : 10.1016/j.endm.2009.11.050

URL : https://hal.archives-ouvertes.fr/hal-01294656