On the expected time of the first occurrence of every k bit long patterns in the symmetric Bernoulli process
From MaRDI portal
Publication:1086903
DOI10.1007/BF01949147zbMath0609.60015MaRDI QIDQ1086903
Publication date: 1986
Published in: Acta Mathematica Hungarica (Search for Journal in Brave)
Related Items (2)
Maximum Waiting Times are Asymptotically Independent ⋮ Cover times for words in symmetric and nonsymmetric cases: A comparison
Cites Work
This page was built for publication: On the expected time of the first occurrence of every k bit long patterns in the symmetric Bernoulli process
