The Occurrence of Sequence Patterns in Repeated Dependent Experiments

DOI10.1137/1135015zbMath0724.60082OpenAlexW2043631613MaRDI QIDQ3212086

Ourania Chryssaphinou, Stavros G. Papastavridis

Publication date: 1990

Published in: Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1135015

zbMATH Keywords

generating functionexpectation of the waiting timesequence of Markov experiments

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items

The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach ⋮ Explicit distributional results in pattern formation ⋮ Sooner and later waiting time problems for success and failure runs in higher order Markov dependent trials ⋮ String matching and 1d lattice gases ⋮ Waiting times and stopping probabilities for patterns in Markov chains ⋮ Stopping Probabilities for Patterns in Markov Chains ⋮ How long does it take to see a flat Brownian path on the average? ⋮ Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata ⋮ Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains ⋮ On occurrence of subpattern and method of gambling teams ⋮ Improved compound Poisson approximation for the number of occurrences of any rare word family in a stationary markov chain ⋮ A martingale approach to scan statistics