2011/12/29 by Shalosh B. Ekhad, Doron Zeilberger, Ekhad, Shalosh B. +1
Computer Science · #Algorithms and Data Compression #Combinatorics (math.CO) #FOS: Mathematics #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1112.6207
openalex publication_date 2011/12/29 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
Richard Stanely proposed, in a recent Amer. Math. Monthly Problem, to prove a nice explicit formula for the generating function for the number of n-letter words in H,T that have as many occurrences of HT as HH. In this article, we show how to prove this problem automatically, and ANY problem of that type, regardless of the size of the alphabet and the length of the two chosen strings