ABSTRACT
In some earlier work, Gani (1998a, 1998b) and Gani and Irle (1999) have examined problems of patterns arising in sequences of length n > 0 of random events, whether independent or Markovian. Here, we apply the known results to the case where these events form patterns on a 2 × n lattice such as that illustrated in Figure 6.1., where the (a j , b j , c j , d j ) are elements selected from some alphabet of size M.
