Abstract
Consider a stationary Markov chainwith state space consisting of theξ-letter alphabet set Λ= {a1, a2, ···,aξ}.We study the variablesM=M(n, k) andN=N(n, k),defined, respectively, as the number of overlapping and non-overlapping occurrences of a fixed periodick-letter word, and use the Stein–Chen method to obtain compound Poisson approximations for their distribution.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
