Automatic Solution of Richard Stanley's Amer. Math. Monthly Problem #11610 and ANY Problem of That Type

Abstract

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

Accompanied by Maple package <A HREF="http://www.math.rutgers.edu/~zeilberg/tokhniot/RPS">RPS</A> . Sample input and output files can be gotten from <a href="http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/rps.html">this page</a>