On a Variation of Gambler's Ruin Problem

Zhiyi Chi, Vladimir Pozdnyakov

Assume that letters (from a finite alphabet) in a text form a Markov chain. We track two distinct words, $U$ and $D$. A gambler gains 1 point for each occurrence of $U$ (including…