Abstract
Consider a sequence of Markov dependent trials where each trial pro-duces a letter of a nite alphabet. Given a collection of patterns, we lookat this sequence till the moment at which one of these patterns appears asa run. We show how the method of gambling teams may be employed to tond mean waiting time of the collection, its probability generating functionand compute the probability tha…