Enumeration of some classes of words avoiding two generalized patterns of length three

Authors:
Antonio Bernini;Luca Ferrari;Renzo Pinzani
Affiliations:
Dipartimento di Sistemi e Informatica, Firenze, Italy;Dipartimento di Sistemi e Informatica, Firenze, Italy;Dipartimento di Sistemi e Informatica, Firenze, Italy
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2009

Citing 4
Cited 0

Generating trees and the Catalan and Schro¨der numbers

Discrete Mathematics
Generating functions for generating trees

Discrete Mathematics
Enumeration schemes for restricted permutations

Combinatorics, Probability and Computing
Restricted k-ary words and functional equations

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The method we have applied in [4] to count pattern avoiding permutations is adapted to words. As an application, we enumerate several classes of words simultaneously avoiding two generalized patterns of length 3.