Abstract
The paper derives the joint generating function of a collection of pattern statistics associated with binary sequences. The models discussed cover independent and some dependent Bernoulli trials, including Markov dependent ones. The results cover, in particular, the moment generating function of the random search time for certain general binary patterns in the popular Knuth-Morris-Pratt algorithm and hence shed more light into its performance.
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 callMore From: Australian & New Zealand Journal of Statistics
Disclaimer: 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.
