Forbidden substrings on weighted alphabets

Details Forbidden substrings on weighted alphabets Forbidden substrings on weighted alphabets

2009-06-20

arxiv.org/abs/0906.3763v1

Mathematics

Combinatorics

8 pages

Scientific paper

In an influential 1981 paper, Guibas and Odlyzko constructed a generating function for the number of length n strings over a finite alphabet that avoid all members of a given set of forbidden substrings. Here we extend this result to the case in which the strings are weighted. 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.

Affiliated with

Also associated with

No associations

Rating

Forbidden substrings on weighted alphabets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Forbidden substrings on weighted alphabets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Forbidden substrings on weighted alphabets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-13252