H. Michael, S. Albert, N. Linton, and . Ru?kuc, The insertion encoding of permutations, Electron. J. Combin, vol.12, issue.1, 2005.

M. Bóna, Combinatorics of Permutations. Discrete Mathematics and its Applications, 2004.

]. G. Bax64 and . Baxter, On fixed points of the composite of commuting functions, Proceedings of the American Mathematical Society, pp.851-855, 1964.

L. [. Berstel and . Boasson, Partial words and a theorem of Fine and Wilf, Theoretical Computer Science, vol.218, issue.1, pp.135-141, 1999.
DOI : 10.1016/S0304-3975(98)00255-2
URL : https://hal.archives-ouvertes.fr/hal-00619468

M. [. Bonichon, . Bousquet-mélou, and . Fusy, Baxter permutations and plane bipolar orientations, The International Conference on Topological and Geometric Graph Theory, pp.69-74, 2008.
DOI : 10.1016/j.endm.2008.06.011
URL : https://hal.archives-ouvertes.fr/hal-00355755

[. Blakeley, F. Blanchet-sadri, J. Gunter, and N. Rampersad, Developments in Language Theory, LNCS, chapter On the Complexity of Deciding Avoidability of Sets of Partial Words, vol.5583, pp.113-124, 2009.

]. W. Boy81 and . Boyce, Baxter permutations and functional composition, Houston Journal of Mathematics, vol.7, issue.2, pp.175-189, 1981.

E. [. Babson and . Steingrímsson, Generalized permutation patterns and a classification of the Mahonian statistics, Séminaire Lotharingien de Combinatoire, p.18, 2000.

. [. Blanchet-sadri, Algorithmic combinatorics on partial words. Discrete Mathematics and its Applications, 2008.

. Bsbk-+-09-]-f, N. C. Blanchet-sadri, A. Brownstein, J. Kalcic, T. Palumbo et al., Unavoidable sets of partial words, Theory of Computing Systems, pp.381-406, 2009.

J. [. Babson and . West, The Permutations 123 p 4 ??? p m and 321 p 4 ??? p m are Wilf-Equivalent, Graphs and Combinatorics, vol.16, issue.4, pp.373-380, 2000.
DOI : 10.1007/s003730070001

J. Backelin, J. West, and G. Xin, Wilf-equivalence for singleton classes, Advances in Applied Mathematics, vol.38, issue.2, pp.133-148, 2007.
DOI : 10.1016/j.aam.2004.11.006

R. [. Chung, V. E. Graham, M. Hoggatt-jr, and . Kleiman, The number of baxter permutations, Journal of Combinatorial Theory, Series A, vol.24, issue.3, pp.382-394, 1978.
DOI : 10.1016/0097-3165(78)90068-7

O. [. Dulucq and . Guibert, Stack words, standard tableaux and Baxter permutations, Discrete Mathematics, vol.157, issue.1-3, pp.91-106, 1996.
DOI : 10.1016/S0012-365X(96)83009-3
URL : https://hal.archives-ouvertes.fr/hal-00307519

O. [. Dulucq and . Guibert, Baxter permutations, Proceedings of the 7th Conference on Formal Power Series and Algebraic Combina- torics, pp.143-156, 1998.
DOI : 10.1016/S0012-365X(97)00112-X
URL : https://hal.archives-ouvertes.fr/hal-00307514

E. [. Felsner, M. Fusy, D. Noy, and . Orden, Bijections for Baxter families and related objects, Journal of Combinatorial Theory, Series A, vol.118, issue.3, 2008.
DOI : 10.1016/j.jcta.2010.03.017
URL : https://hal.archives-ouvertes.fr/hal-00714699

V. Halava, T. Harju, and T. Kärki, Square-free partial words, Information Processing Letters, vol.108, issue.5, pp.290-292, 2008.
DOI : 10.1016/j.ipl.2008.06.001

T. [. Halava, T. Harju, P. Kärki, and . Séébold, Overlap-freeness in infinite partial words, Theoretical Computer Science, vol.410, issue.8-10, pp.8-10943, 2009.
DOI : 10.1016/j.tcs.2008.12.041
URL : https://hal.archives-ouvertes.fr/lirmm-00382675

]. V. Jel07 and . Jelínek, Dyck paths and pattern-avoiding matchings, European Journal of Combinatorics, vol.28, issue.1, pp.202-213, 2007.

]. C. Kra06 and . Krattenthaler, Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes, Advances in Applied Mathematics, vol.37, issue.3, pp.404-431, 2006.

]. P. Leu05 and . Leupold, Partial words for dna coding, DNA 10, Tenth International Meeting on DNA Computing, pp.224-234, 2005.

]. C. Mal79 and . Mallows, Baxter permutations rise again, Journal of Combinatorial Theory, Series A, vol.27, issue.3, pp.394-396, 1979.

A. Regev, Asymptotic values for degrees associated with strips of young diagrams, Advances in Mathematics, vol.41, issue.2, pp.115-136, 1981.
DOI : 10.1016/0001-8708(81)90012-8

Y. [. Shur and . Konovalova, On the Periods of Partial Words, MFCS '01: Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science, pp.657-665, 2001.
DOI : 10.1007/3-540-44683-4_57

]. Z. Sta94, . Stankovasw02-]-z, J. Stankova, and . West, Forbidden subsequences A new class of Wilf-equivalent permutations, Discrete Mathematics J. Algebraic Comb, vol.132, issue.153, pp.291-316271, 1994.

]. G. Vie81 and . Viennot, A bijective proof for the number of Baxter permutations, 1981.