Creative Commons "Este é um artigo publicado em acesso aberto sob uma licença Creative commons (CC BY 4.0). Fonte: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84903776159&origin=inward. Acesso em 17 Outubro 2022.GAVA, R. J.SALOTTI, D.2022-01-122022-01-122014-03-05GAVA, R. J.; SALOTTI, D. Stopping probabilities for patterns in markov chains. Journal of Applied Probability, v. 51, n. 1, p. 287-292, March, 2014.0021-9002https://repositorio.fei.edu.br/handle/FEI/4048Consider 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. © Applied Probability Trust 2014.Acesso AbertoArtigo10.1239/jap/1395771430Gambling teamMarkov chainMartingalePatternStopping probabilityStopping timeWaiting time