The Waiting Time for Simple Pattern with Overlapping andNonoverlapping Schemes
碩士 === 國立高雄大學 === 統計學研究所 === 94 === In this thesis, we are mainly concerned with the expected waiting time of certain pattern in a higher order homogenous Markov chain. In particular, we consider the case where the pattern occurs more than two times by using two counting methods: the overlapping and...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/93099768481569485033 |
| Summary: | 碩士 === 國立高雄大學 === 統計學研究所 === 94 === In this thesis, we are mainly concerned with the expected waiting time of certain pattern in
a higher order homogenous Markov chain. In particular, we consider the case where the
pattern occurs more than two times by using two counting methods: the overlapping and
nonoverlapping schemes. The differences between these two methods. And we also get the
generating function of the waiting time under a simple pattern will be discussed.
|
|---|