Counting occurrences for a finite set of words: combinatorial methods


28 pagesInternational audienceIn this article, we give the multivariate generating function counting texts according to their length and to the number of occurrences of words from a finite set. The application of the inclusion- exclusion principle to word counting due to Goulden and Jackson (1979, 1983) is used to derive the result. Unlike some other techniques which suppose that the set of words is reduced (i.e., where no two words are factor of one another), the finite set can be chosen arbitrarily. Noonan and Zeilberger (1999) already provided a Maple package treating the non-reduced case, without giving an expression of the generating function or a detailed proof. We provide a complete proof validating the use of the inclusion-exclusion principle. We also restate in modern terms the normal limit laws theorems of Bender and Kochman (1993), emphasising on the underlying analytic mean shifting method

Similar works

Full text


HAL-Paris 13

Full text is not available
oaioai:HAL:hal-00452694v2Last time updated on 11/11/2016

This paper was published in HAL-Paris 13.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.