• Corpus ID: 18133722

Avoiding substrings in compositons

@article{Heubach2009AvoidingSI,
  title={Avoiding substrings in compositons},
  author={Silvia Heubach and Sergey Kitaev},
  journal={arXiv: Combinatorics},
  year={2009}
}
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 (number of parts) and weight. We also give examples of families of strings to be avoided that allow for an… 
1 Citations

Figures from this paper

Forbidden substrings on weighted alphabets

This investigation was inspired by the problem of counting compositions of an integer n that avoid all compositions of a smaller integer m, a notion which arose from the consideration of one-sided random walks.

References

SHOWING 1-8 OF 8 REFERENCES

Forbidden substrings on weighted alphabets

This investigation was inspired by the problem of counting compositions of an integer n that avoid all compositions of a smaller integer m, a notion which arose from the consideration of one-sided random walks.

String Overlaps, Pattern Matching, and Nontransitive Games

Binary strings and substring avoidance, Master thesis, CTH and Göteborg

  • 2002

Combinatorics of Compositions and Words, CRC Press

  • Boca Raton,
  • 2009

Combinatorics of Compositions and Words, to appear, CRC Press

  • Boca Raton,
  • 2009

Combinatorics of Compositions and Words, to appear

  • Combinatorics of Compositions and Words, to appear
  • 2009

Binary strings and substring avoidance

  • 2002

Counting independent sets on path-schemes

  • Journal of Integer Sequences 9,
  • 2006