Enumeration schemes for words avoiding permutations  pp. 193-212

Enumeration schemes for words avoiding permutations

By Lara Pudwell
[10] D. Zeilberger . On Vince Vatter's brilliant extension of Doron Zeilberger's enumeration schemes for Herb Wilf's classes. The Personal Journal of Ekhad and Zeilberger, published electronically at http://www.math.rutgers.edu/∼zeilberg/pj.html, 2006.
[1] M. H. Albert , R. E. L. Aldred , M. D. Atkinson , C. Handley , and D. Holton . Permutations of a multiset avoiding permutations of length 3. European J. Combin., 22(8):1021–1031, 2001.
[2] P. Brändén and T. Mansour . Finite automata and pattern avoidance in words. J. Combin. Theory Ser. A, 110(1):127–145, 2005.
[3] A. Burstein . Enumeration of Words with Forbidden Patterns. PhD thesis, University of Pennsylvania, 1998.
[4] G. Firro . Distanced patterns. PhD thesis, University of Haifa, 2007.
[5] G. Firro and T. Mansour . Three-letter-pattern-avoiding permutations and functional equations. Electron. J. Combin., 13(1):Research Paper 51, 14 pp., 2006.
[6] G. Firro and T. Mansour . Restricted k-ary words and functional equations. Discrete Appl. Math., 157(4):602–616, 2009.
[7] L. Pudwell . Enumeration schemes for words avoiding patterns with repeated letters. Integers, 8:A40, 19, 2008.
[8] V. Vatter . Enumeration schemes for restricted permutations. Combin. Probab. Comput., 17:137–159, 2008.
[9] D. Zeilberger . Enumeration schemes and, more importantly, their automatic generation. Ann. Comb., 2(2):185–195, 1998.