Aki, S., Balakrishnan, N. and Mohanty, S. G. (1996). Sooner and later waiting time problems and failure runs in higher order Markov dependent trials. Ann. Inst. Statist. Math.
Antzoulakos, D. (2001). Waiting times for patterns in a sequence of multistate trials. J. Appl. Prob.
Benevento, R. V. (1984). The occurrence of sequence patterns in ergodic Markov chains. Stoch. Process. Appl.
Biggins, J. D. and Cannings, C. (1987a). Formulas for mean restriction-fragment lengths and related quantities. Amer. J. Hum. Genet.
Biggins, J. D. and Cannings, C. (1987b). Markov renewal processes, counters and repeated sequences in Markov chains. Adv. Appl. Prob.
Blom, G. and Thorburn, D. (1982). How many random digits are required until given sequences are obtained?
J. Appl. Prob.
Breen, S., Waterman, M. and Zhang, N. (1985). Renewal theory for several patterns. J. Appl. Prob.
Chryssaphinou, O. and Papastavridis, S. (1990). The occurrence of a sequence of patterns in repeated dependent experiments. Theory Prob. Appl.
Feller, W. (1968). An Introduction to Probability Theory and Its Applications, Vol. 1, 3rd edn.
John Wiley, New York.
Fu, J. C. (1986). Reliability of consecutive-k-out-of-n: F systems with (k-1)-step Markov dependence. IEEE Trans. Reliab.
Fu, J. C. (2001). Distribution of the scan statistics for a sequence of bistate trials. J. Appl. Prob.
Fu, J. C. and Chang, Y. (2002). On probability generating functions for waiting time distribution of compound patterns in a sequence of multistate trials. J. Appl. Prob.
Fu, J. C. and Koutras, M. V. (1994). Distribution theory of runs: a Markov chain approach. J. Amer. Statist. Assoc.
Gerber, H. and Li, S. (1981). The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain. Stoch. Process. Appl.
Guibas, L. and Odlyzko, A. (1981a). Periods of strings. J. Combinatorial Theory A
Guibas, L. and Odlyzko, A. (1981b). String overlaps, pattern matching and nontransitive games. J. Combinatorial Theory A
Han, Q. and Hirano, K. (2003). Sooner and later waiting time problems for patterns in Markov dependent trials. J. Appl. Prob.
Li, S. (1980). A martingale approach to the study of occurrence of sequence patterns in repeated experiments. Ann. Prob.
Pozdnyakov, V. and Kulldorff, M. (2006). Waiting times for patterns and a method of gambling teams. Amer. Math. Monthly
Pozdnyakov, V., Glaz, J., Kulldorff, M. and Steele, J. M. (2005). A martingale approach to scan statistics. Ann. Inst. Statist. Math.
Robin, S. and Daudin, J.-J. (1999). Exact distribution of word occurrences in a random sequence of letters. J. Appl. Prob.
Stefanov, V. T. (2000). On some waiting time problems. J. Appl. Prob.
Stefanov, V. T. (2003). The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach. J. Appl. Prob.
Stefanov, V. T. and Pakes, A. G. (1997). Explicit distributional results in pattern formation. Ann. Appl. Prob.
Uchida, M. (1998). On generating functions of waiting time problems for sequence patterns of discrete random variables. Ann. Inst. Statist. Math.
Williams, D. (1991). Probability with Martingales. Cambridge University Press.