S. Abbes and K. Keimel, Projective topology on bifinite domains and applications, Theoretical Computer Science, vol.365, issue.3, pp.171-183, 2006.
DOI : 10.1016/j.tcs.2006.07.047
URL : https://hal.archives-ouvertes.fr/hal-00350211

S. Abbes and J. Mairesse, Uniform and Bernoulli measures on the boundary of trace monoids, Journal of Combinatorial Theory, Series A, vol.135, pp.201-236, 2015.
DOI : 10.1016/j.jcta.2015.05.003
URL : https://hal.archives-ouvertes.fr/hal-01158021

M. Aigner, A Course in Enumeration, 2007.

A. Bertoni, Counting Techniques for Inclusion, Equivalence and Membership Problems, World Scientific, pp.131-163, 1994.
DOI : 10.1142/9789814261456_0005

O. Bodini, A. Genitrini, and F. Peschanski, Enumeration and random generation of concurrent computations, Proc. of AofA'12. DMTCS, 2012, pp.83-96
URL : https://hal.archives-ouvertes.fr/hal-01197236

P. Cartier and D. Foata, Problèmes combinatoires de commutation et réarrangements, Lecture Notes in Math, vol.85, 1969.
DOI : 10.1007/BFb0079468

P. Csikvári, Note on the Smallest Root of the Independence Polynomial, Combinatorics, Probability and Computing, vol.17, issue.01, pp.1-8, 2013.
DOI : 10.1002/jgt.3190130411

V. Diekert and G. Rozenberg, The Book of Traces, World Scientific, 1995.
DOI : 10.1142/2563

P. Duchon, 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, P. Zimmermann, and B. Van-cutsem, A calculus for the random generation of labelled combinatorial structures, Theoretical Computer Science, vol.132, issue.1-2, pp.233-248, 1994.
DOI : 10.1016/0304-3975(94)90226-7
URL : https://hal.archives-ouvertes.fr/hal-00917729

M. Jerrum, Counting, sampling and integrating: algorithms and complexity, 2013.
DOI : 10.1007/978-3-0348-8005-3

B. P. Kitchens, Symbolic dynamics. One-sided, two-sided and countable state Markov shifts, 1998.

D. Krob, J. Mairesse, and I. Michos, Computing the average parallelism in trace monoids, Discrete Mathematics, vol.273, issue.1-3, pp.131-162, 2003.
DOI : 10.1016/S0012-365X(03)00233-4
URL : https://hal.archives-ouvertes.fr/hal-00018551

D. Lind and B. Marcus, An introduction to symbolic dynamics and coding, 1995.
DOI : 10.1017/CBO9780511626302

W. Parry, Intrinsic Markov chains, Transactions of the American Mathematical Society, vol.112, issue.1, pp.55-66, 1964.
DOI : 10.1090/S0002-9947-1964-0161372-1

G. Rota, On the foundations of combinatorial theory I. Theory of M???bius Functions, Zeitschrift f???r Wahrscheinlichkeitstheorie und Verwandte Gebiete, vol.73, issue.4, pp.340-368, 1964.
DOI : 10.1007/BF00531932

X. Viennot, Heaps of pieces, I : Basic definitions and combinatorial lemmas, In: Combinatoire énumérative. Lecture Notes in Math, vol.56, pp.321-350, 1986.
DOI : 10.1016/0012-365X(85)90192-X