A. Burstein, Enumeration of words with forbidden patterns, 1998.

A. Burstein-and-t and . Mansour, Words restricted by patterns with at most 2 distinct letters, Electron, J. Combin, vol.9, issue.2, p.3, 2002.

A. Burstein-and-t and . Mansour, Words Restricted by 3-Letter Generalized Multipermutation Patterns, Annals of Combinatorics, vol.7, issue.1, pp.1-14, 2003.
DOI : 10.1007/s000260300000

A. Burstein-and-t and . Mansour, Counting occurrences of some subword patterns, Discr. Math. Theor. Comp. Sci, vol.6, pp.1-012, 2003.

J. Hall, J. Liese, and A. J. , REMMEL, q-analogues of formulas counting descent pairs with prescribed tops and bottoms

J. J. Hall and . Remmel, Counting descent pairs with prescribed tops and bottoms, Journal of Combinatorial Theory, Series A, vol.115, issue.5, pp.693-725, 2008.
DOI : 10.1016/j.jcta.2007.09.001

S. Heubach-and-t and . Mansour, Counting rises, levels, and drops in compositions, Integers: Elect, Article A11, 2005.

S. J. Kitaev and . Remmel, Classifying Descents According to Parity, Annals of Combinatorics, vol.11, issue.2, pp.173-193, 2007.
DOI : 10.1007/s00026-007-0313-2

S. J. Kitaev and . Remmel, Classifying Descents According to Equivalence mod k, Elect, J. Combin, vol.13, issue.1, p.64, 2006.

J. Liese, Classifying ascents and descents with specified equivalences mod k, Proceedings of 18- th International Conference on Formal Power Series and Algebra Combinatorics, 2006.

J. J. Liese and . Remmel, q-analogues of formulas f or the number of ascents and descents with specified equivalences mod K, Permutation Patterns Conference, 2006.