The Occurrence of Sequence Patterns in Repeated Dependent Experiments

A sequence of Markov dependent experiments is performed, each one of them producing a letter from a given alphabet. We study the following question: How many trials does it take to observe a member of a specified finite set of patterns of letters for the first time?