Counting Clean Words According to the Number of Their Clean Neighbors
From MaRDI portal
Publication:6433930
DOI10.1145/3610377.3610379arXiv2304.11253OpenAlexW4384911804WikidataQ130964630 ScholiaQ130964630MaRDI QIDQ6433930FDOQ6433930
Authors: Shalosh B. Ekhad, Doron Zeilberger 
Publication date: 21 April 2023
Abstract: We extract brilliant ideas of Sandi Klavzar, Michel Mollard, and Marko Petkovsek who used them to solve one very specific enumeration problem, namely counting the number of words in the alphabet {0,1} of length n avoiding two consecutive ones, and having exactly k such neighbors, to a much more general setting where one has any (finite) alphabet, and any (finite) set of forbidden subwords. More important, we fully implement it in Maple.
Full work available at URL: https://doi.org/10.1145/3610377.3610379
This page was built for publication: Counting Clean Words According to the Number of Their Clean Neighbors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6433930)
