Abstract
This paper considers patterns of particular events A1,...,Ak(k ≥ 2) in sequences of trials, some independent and others Markovian. Matrix recursions are found for the number of sequences of length n avoiding a specific pattern, and the associated probability of this event is evaluated. A Markov chain method for the study of such problems is outlined, and is illustrated in various cases. Finally, configurations of length 3 in Bernoulli trials are examined as an example.
| Original language | English |
|---|---|
| Pages (from-to) | 295-309 |
| Number of pages | 15 |
| Journal | Monatshefte fur Mathematik |
| Volume | 127 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1999 |