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.
"Stopping probabilities for patterns in Markov chains." J. Appl. Probab. 51 (1) 287 - 292, March 2014. https://doi.org/10.1239/jap/1395771430