Sponsored by the Rutgers University Department of Mathematics and the

Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)

**Co-organizers:****Andrew Baxter**, Rutgers University, baxter{at} math [dot] rutgers [dot] edu**Lara Pudwell**, Rutgers University, lpudwell {at} math [dot] rutgers [dot] edu**Doron Zeilberger**, Rutgers University, zeilberg {at} math [dot] rutgers [dot] edu

Title: Finding the Number of Words Avoiding a Set of Forbidden Subwords

Speaker: **Debbie Yuster**, DIMACS

Date: Thursday, October 23, 2008 5:00pm

Location: Hill Center, Room 705, Rutgers University, Busch Campus, Piscataway, NJ

Abstract:

Given a set of 'bad' or forbidden words, we consider the problem of computing how many length n words avoid these bad words. We will discuss several approaches to answering this question using generating functions. The main focus of the talk will be the Goulden-Jackson cluster method and some generalizations. This work is joint with Beth Kupin.