[
[1] X. Viennot, Heaps of pieces, I: basic definitions and combinatorial lemmas, in: Labelle, G. and Leroux, P. (Eds.), Combinatoire énumérative, Lecture Notes in Math., 1234 (1986) 321–350.
]Search in Google Scholar
[
[2] P. Cartier and D. Foata, Problèmes combinatoires de commutation et réarrangements, Lecture Notes in Math., 85 (1969).10.1007/BFb0079468
]Search in Google Scholar
[
[3] S. Abbes and J. Mairesse, Uniform and Bernoulli measures on the boundary of trace monoids, J. Combin. Theory Ser. A, 135 (2015) 201–236.
]Search in Google Scholar
[
[4] S. Abbes and J. Mairesse, Uniform generation in trace monoids, in: Italiano, G., Pighizzini, G. and Sannella, D. (Eds.), Mathematical Foundations of Computer Science 2015 (MFCS 2015), Lecture Notes in Comput. Sci., 9234 (2015) 63–75.
]Search in Google Scholar
[
[5] C. Krattenthaler, The theory of heaps and the Cartier-Foata monoid, in Electronic reed-ition of “Problèmes combinatoires de commutation et rárrangements”, pp. 63–73, EMIS, 2006.
]Search in Google Scholar
[
[6] S. Abbes, Synchronization of Bernoulli sequences on shared letters, Inform. and Comput., 255 (2017) 1–26.
]Search in Google Scholar
[
[7] S. Abbes, A cut-invariant law of large numbers for random heaps, J. Theoret. Probab., 30 (2017) 1692–1725.
]Search in Google Scholar
[
[8] V. Diekert and G. Rozenberg, The Book of Traces, World Scientific, 1995.10.1142/2563
]Search in Google Scholar
[
[9] V. Diekert, Combinatorics on traces, Lecture Notes in Comput. Sci., 454 (1990).10.1007/3-540-53031-2
]Search in Google Scholar
[
[10] M. Goldwurm and M. Santini, Clique polynomials have a unique root of smallest modulus, Inform. Process. Lett., 75 (2000) 127–132.
]Search in Google Scholar
[
[11] D. Krob, J. Mairesse and I. Michos, Computing the average parallelism in trace monoids, Discrete Math., 273 (2003) 131–162.
]Search in Google Scholar
[
[12] P. Csikvári, Note on the smallest root of the independence polynomial, Combin. Probab. Comput., 22 (2013) 1–8.
]Search in Google Scholar
