Abstract
A sequence of Markov dependent experiments is performed, each one of them producing a letter from a given alphabet. We study the following question: How many trials does it take to observe a member of a specified finite set of patterns of letters for the first time?
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.
