Abstract
In this paper, we consider the waiting time distributions for patterns in a sequence of multistate trials. A simple and general framework, using the Markov chain imbedding method, is developed to study the waiting time distributions of both simple and compound patterns. Algorithms for the computation of these are given. The general theory is employed for the investigation of some examples in order to illustrate the theoretical results.
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.
