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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.