Restricted k-ary words and functional equations

Alon, 2000, On the number of permutations avoiding a given pattern, J. Combin. Theory Ser. A, 89, 133, 10.1006/jcta.1999.3002 Atkinson, 1999, Restricted permutations, Discrete Math., 195, 27, 10.1016/S0012-365X(98)00162-9 Babson, 2000, Generalized permutation patterns and a classification of the Mahonian statistics, Sémin. Lothar. Combin., 44 Banderier, 2002, Generating functions for generating trees, Discrete Math., 246, 29, 10.1016/S0012-365X(01)00250-3 Bóna, 1997, Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps, J. Combin. Theory Ser. A, 80, 257, 10.1006/jcta.1997.2800 Bousquet-Mélou, 2003, Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels, Electron. J. Combin., 9, #R19, 10.37236/1691 Brändén, 2005, Finite automata and pattern avoidance in words, J. Combin. Theory Ser. A, 110, 127, 10.1016/j.jcta.2004.10.007 A. Burstein, Enumeration of words with forbidden patterns, Ph.D. Thesis, University of Pennsylvania, 1998 Burstein, 2002, Words restricted by patterns with at most 2 distinct letters, Electron. J. Combin., 9, #R3, 10.37236/1675 Burstein, 2003, Words restricted by 3-letter generalized multipermutation patterns, Ann. Combin., 7, 1, 10.1007/s000260300000 G. Firro, T. Mansour, Restricted permutations and polygons, Preprint Firro, 2006, Three-letter-pattern-avoiding permutations and functional equations, Electron. J. Combin., 13, #R51, 10.37236/1077 Knuth, 1973, vol. 3 Mansour, 2006, Restricted 132-avoiding k-ary words, Chebyshev polynomials, and Continued fractions, Adv. Appl. Math., 36, 175, 10.1016/j.aam.2005.04.003 Mansour, 2001, Restricted 132-avoiding permutations, Adv. Appl. Math., 26, 258, 10.1006/aama.2000.0719 Mansour, 2002, Counting occurrences of 132 in a permutation, Adv. Appl. Math., 28, 185, 10.1006/aama.2001.0773 Marcus, 2004, Excluded permutation matrices and the Stanley–Wilf conjecture, J. Combin. Theory Ser. A, 107, 153, 10.1016/j.jcta.2004.04.002 Noonan, 1996, The number of permutations containing exactly one increasing subsequence of length three, Discrete Math., 152, 307, 10.1016/0012-365X(95)00247-T Noonan, 1996, The enumeration of permutations with a prescribed number of forbidden patterns, Adv. Appl. Math., 17, 381, 10.1006/aama.1996.0016 Simion, 1985, Restricted permutations, European J. Combin., 6, 383, 10.1016/S0195-6698(85)80052-4 Vatter, 2008, Enumeration schemes, Combinatorics, Probab. Comput., 17, 137, 10.1017/S0963548307008516 J. West, Permutations with forbidden subsequences, and stack-sortable permutations, Ph.D. Thesis, MIT, 1990 West, 1995, Generating trees and the Catalan and Schröder numbers, Discrete Math., 146, 247, 10.1016/0012-365X(94)00067-1 Zeilberger, 1990, A Holonomic systems approach to special functions identities, J. Comput. Appl. Math., 32, 321, 10.1016/0377-0427(90)90042-X Zeilberger, 1998, Enumeration schemes, and more importantly, their automatic generation, Ann. Combin., 2, 185, 10.1007/BF01608488 Wilf, 1997, On crossing numbers, and some unsolved problems, 557