Résumé : We consider random texts generated by a Bernoulli source. We want to count simultaneously the number of occurrences of words within a finite set of words in a random text of size n. The use of generating functions permits to construct a multivariate function counting the occurrences in texts of all size from 0 to infinity. From there several techniques give access to texts of size n. We compute the multivariate generating function
Dernière modification : mercredi 06 juillet 2011 | Contact : Cyril.Banderier at lipn.univ-paris13.fr |