A. [. Aceto and . Ingólfsdóttir, The Saga of the Axiomatization of Parallel Composition, Atk90] M. D. Atkinson. On computing the number of linear extensions of a tree. Order, pp.2-1623, 1990.
DOI : 10.1007/978-3-540-74407-8_2

A. Boussicault, V. Féray, A. Lascoux, and V. Reiner, Linear extension sums as valuations on cones, Journal of Algebraic Combinatorics, vol.1, issue.3, pp.573-610, 2011.
DOI : 10.1007/s10801-011-0316-2

P. [. Brightwell and . Winkler, Counting linear extensions is #P-complete, Proceedings of the twenty-third annual ACM symposium on Theory of computing , STOC '91, pp.175-181, 1991.
DOI : 10.1145/103418.103441

E. M. Clarke, O. Grumberg, and D. Peled, Model checking Hopf algebras, renormalization and noncommutative geometry, Comm. Math. Phys, vol.199, issue.1, pp.203-242, 1998.

]. L. Com74 and . Comtet, Advanced Combinatorics: The Art of Finite and Infinite Expansions. Reidel, 1974.

]. N. De-bruijn, D. E. Knuth, and S. O. Rice, The average height of planted plane trees. Graph Theory and Computing, pp.15-22, 1972.

B. [. Drmota and . Gittenberger, The width of Galton-Watson trees conditioned by the size, Discrete Math. Theor. Comput. Sci, vol.6, issue.2, pp.387-400, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00959015

G. Duchamp, F. Hivert, J. Novelli, and J. Thibon, Noncommutative Symmetric Functions VII: Free Quasi-Symmetric Functions Revisited, Annals of Combinatorics, vol.175, issue.2, pp.655-673, 2011.
DOI : 10.1007/s00026-011-0115-4
URL : https://hal.archives-ouvertes.fr/hal-00826640

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

]. M. Drm09 and . Drmota, Random trees, FS09] P. Flajolet and R. Sedgewick. Analytic Combinatorics, 2009.

A. Gaudel, S. Denise, R. Gouraud, J. Lassaigne, S. Oudinet et al., Coverage-biased Random Exploration of Models, ETAPS Workshop on Model Based Testing, pp.3-14, 2008.
DOI : 10.1016/j.entcs.2008.11.002
URL : https://hal.archives-ouvertes.fr/inria-00560621

]. D. Knu98 and . Knuth, The art of computer programming

]. L. Lip89 and . Lipshitz, D-finite power series, J. Algebra, vol.122, pp.353-373, 1989.

[. Milner, A Calculus of Communicating Systems, 1980.
DOI : 10.1007/3-540-10235-3

M. [. Mishna and . Zabrocki, Analytic aspects of the shuffle product, STACS, pp.561-572, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00255817

P. [. Salvy and . Zimmerman, GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable, ACM Transactions on Mathematical Software, vol.20, issue.2, pp.163-177, 1994.
DOI : 10.1145/178365.178368
URL : https://hal.archives-ouvertes.fr/hal-00917741

M. [. Wong and . Easton, An Efficient Method for Weighted Sampling without Replacement, SIAM Journal on Computing, vol.9, issue.1, pp.111-113, 1980.
DOI : 10.1137/0209009