The detection of words and an ordering for Markov chains

Journal of Applied Probability

Volumn 38A, Issue , 2001, Pages 66-77

  Irle, Albrecht ^a   Gani, Joseph ^b  

^a UNIVERSITY OF KIEL   (Germany)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

Level crossing; Patterns; Stochastic automata; Stochastic ordering

Indexed keywords

EID: 33645374671     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1085496592     Document Type: Article

References (8)

1. Blom, G. (1984). On the stochastic ordering of waiting times for patterns in sequences of random digits. J. Appl. Probab. 21, 730-737.
2. Blom, G. and Thorburn, D. (1982). How many random digits are required until given sequences are obtained? J. Appl. Probab. 19, 518-531.
3. Daley, D. J. (1968). Stochastically monotone Markov chains. Z. Wahrscheinlichkeitsth. 10, 305-317.
4. Fu, J. C. and Koutras, M. V. (1994). Distribution theory of runs: a Markov chain approach. J. Amer. Statist. Assoc. 89, 1050-1058.
5. Gani, J. and Irle, A. (1999). On patterns in sequences of random events. Monatsh. Math. 127, 295-309.
6. Guibas, L. J. and Odlyzko, A. M. (1981). String overlaps, pattern matching, and nontransitive games. J. Combin. Theory A 30, 181-208.
7. Shaked, M. and Shanthikumar, J. G. (1994). Stochastic Orders and Their Applications. Academic Press, Boston.
8. Stoyan, D. (1983). Comparison Methods for Queues and Other Stochastic Models. Wiley, Chichester. (Translation from the German edited by D. J. Daley).