Abstract
Let A be a finite alphabet and let D be a finite set of words in A* labelled dirty. We give a recursive procedure for computing the generating function for the number of words not containing any subsequences that belong to D and having a specified number of each letter. We show that this generating function is always a rational function.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 313-315 |
| Number of pages | 3 |
| Journal | Discrete Mathematics |
| Volume | 64 |
| Issue number | 2-3 |
| DOIs | |
| State | Published - Apr 1987 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
Fingerprint
Dive into the research topics of 'Enumerating totally clean words'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver