Abstract
A classical result by Guibas and Odlyzko obtained in 1981 gives the generating function for the number of strings that avoid a given set of substrings with the property that no substring is contained in any of the others. In this paper, we give an analogue of this result for the enumeration of compositions that avoid a given set of prohibited substrings, subject to the compositions’ length and weight.
| Original language | English |
|---|---|
| Pages (from-to) | 87-95 |
| Number of pages | 9 |
| Journal | Congressus Numerantium |
| Volume | 202 |
| Publication status | Published - 2010 |
Keywords
- compositions
- strings
- avoidance