On the enumeration of restricted words over a finite alphabet
Journal of integer sequences, Tome 19 (2016) no. 1
We present a method for the enumeration of restricted words over a finite alphabet. Restrictions are described through the inclusion or exclusion of suitable building blocks used to construct the words by concatenation. Our approach, which relies on the invert transform and its representation in terms of partial Bell polynomials, allows us to generalize and address in a systematic manner previous results in the subject.
Classification :
05A10, 11B83
Keywords: restricted word, invert transform, partial Bell polynomial
Keywords: restricted word, invert transform, partial Bell polynomial
@article{JIS_2016__19_1_a0,
author = {Birmajer, Daniel and Gil, Juan B. and Weiner, Michael D.},
title = {On the enumeration of restricted words over a finite alphabet},
journal = {Journal of integer sequences},
year = {2016},
volume = {19},
number = {1},
zbl = {1329.05011},
language = {en},
url = {http://geodesic.mathdoc.fr/item/JIS_2016__19_1_a0/}
}
Birmajer, Daniel; Gil, Juan B.; Weiner, Michael D. On the enumeration of restricted words over a finite alphabet. Journal of integer sequences, Tome 19 (2016) no. 1. http://geodesic.mathdoc.fr/item/JIS_2016__19_1_a0/