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

S. Buss and M. 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

C. Choffrut and J. Karhumäki, Combinatorics of Words, Handbook of Formal Languages, 1997.
DOI : 10.1007/978-3-642-59136-5_6

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.12, issue.05, pp.671-717, 2002.
DOI : 10.1142/S0218196702001139
URL : https://hal.archives-ouvertes.fr/hal-00622613

S. Eilenberg and S. M. Lane, On the groups of H(?, n). I. Ann. of Math, pp.55-106, 1953.

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

S. A. Joni and G. Rota, Coalgebras and Bialgebras in Combinatorics, Studies in Applied Mathematics, vol.2, issue.3, pp.93-139, 1979.
DOI : 10.1002/sapm197961293

A. Mansfield, On the computational complexity of a merge recognition problem, Discrete Applied Mathematics, vol.5, issue.1, pp.119-122, 1983.
DOI : 10.1016/0166-218X(83)90021-5

D. Henshall, N. Rampersad, and J. Shallit, Shuffling and unshuffling, 2011.

R. Rizzi and S. 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

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

N. J. Sloane, The On-Line Encyclopedia of Integer Sequences. https://oeis

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

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

Y. Vargas, Hopf algebra of permutation pattern functions, 26th International Conference on Formal Power Series and Algebraic Combinatorics, pp.839-850, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01207565

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