Forbidden substrings on weighted alphabets

MaRDI QIDQ3058991zbMATH OpenFDO

Authors Amy N. Myers

Publication date 8 December 2010

Full work available at URL https://arxiv.org/abs/0906.3763

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15)

Abstract: 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.

Recommendations

• Avoiding substrings in compositons
• Palindromes with forbidden substrings
• The distribution of run lengths in integer compositions
• scientific article; zbMATH DE number 1868918
• scientific article; zbMATH DE number 2051157

Cited in

(5)

• Palindromes with forbidden substrings
• ON THE VISUALIZATION OF STRINGS AND FRACTALS OF SOME FORBIDDEN WORDS
• scientific article; zbMATH DE number 6819809 (Why is no real title available?)
• scientific article; zbMATH DE number 1868918 (Why is no real title available?)
• Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences

This page was built for publication: Forbidden substrings on weighted alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058991)