Resumen de Stopping probabilities for patterns in Markov chains

Renato Jacob Gava, Danilo Salotti

• Consider a sequence of Markov-dependent trials where each trial produces a letter of a finite alphabet. Given a collection of patterns, we look at this sequence until one of these patterns appears as a run. We show how the method of gambling teams can be employed to compute the probability that a given pattern is the first pattern to occur