C. Allauzen, Calcul efficace du shuffle de k mots, 2000.

J. [. Bose, A. Buss, and . Lubiw, Pattern matching for permutations, Information Processing Letters, vol.65, issue.5, pp.277-283, 1998.
DOI : 10.1016/S0020-0190(97)00209-3

M. [. Buss and . Soltys, Unshuffling a square is NP-hard, Journal of Computer and System Sciences, vol.80, issue.4, pp.766-776, 2014.
DOI : 10.1016/j.jcss.2013.11.002

URL : http://arxiv.org/pdf/1211.7161

J. [. Choffrut and . Karhumäki, Combinatorics of Words Handbook of Formal Languages, 1997.

G. Duchamp, F. Hivert, and J. Thibon, NONCOMMUTATIVE SYMMETRIC FUNCTIONS VI: FREE QUASI-SYMMETRIC FUNCTIONS AND RELATED ALGEBRAS, International Journal of Algebra and Computation, vol.19, issue.12, pp.671-717, 2002.
DOI : 10.1088/0305-4470/29/22/027

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

S. [. Eilenberg and . Lane, On the groups of H(?, n). I. Ann. of Math, pp.55-106, 1953.
DOI : 10.2307/1969820

D. Grinberg and V. Reiner, Hopf Algebras in Combinatorics, p.2014

S. [. Giraudo and . Vialette, Unshuffling Permutations, Latin American Theoretical Informatics Symposium, vol.9644, pp.509-521, 2016.
DOI : 10.1007/978-3-662-49529-2_38

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

D. Henshall, N. Rampersad, and J. Shallit, Shuffling and Unshuffling, Bulletin of the EATCS, vol.107, pp.131-142, 2012.

G. [. Joni and . Rota, Coalgebras and bialgebras in combinatorics
DOI : 10.1090/conm/006/646798

]. A. Man83 and . Mansfield, On the computational complexity of a merge recognition problem, Discrete Appl. Math, vol.5, pp.119-122, 1983.

S. [. Rizzi and . Vialette, On Recognizing Words That Are Squares for the Shuffle Product, 8th International Computer Science Symposium in Russia, pp.235-245, 2013.
DOI : 10.1007/978-3-642-38536-0_21

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

]. N. Slo and . Sloane, The On-Line Encyclopedia of Integer Sequences

J. Spehner, Le calcul rapide des melanges de deux mots, Theoretical Computer Science, vol.47, pp.181-203, 1986.
DOI : 10.1016/0304-3975(86)90145-3

URL : https://doi.org/10.1016/0304-3975(86)90145-3

R. Simion and F. W. Schmidt, Restricted Permutations, European Journal of Combinatorics, vol.6, issue.4, pp.383-406, 1985.
DOI : 10.1016/S0195-6698(85)80052-4

J. Van-leeuwen and M. Nivat, Efficient recognition of rational relations, Information Processing Letters, vol.14, issue.1, pp.34-38, 1982.
DOI : 10.1016/0020-0190(82)90138-7

M. K. Warmuth and D. Haussler, On the complexity of iterated shuffle, Journal of Computer and System Sciences, vol.28, issue.3, pp.345-358, 1984.
DOI : 10.1016/0022-0000(84)90018-7

URL : https://doi.org/10.1016/0022-0000(84)90018-7