Discrete Mathematics & Theoretical Computer Science, Vol 9, No 1 (2007)

Font Size:  Small  Medium  Large

Waiting Time Distributions for Pattern Occurrence in a Constrained Sequence

Valeri Stefanov, Wojciech Szpankowski


A binary sequence of zeros and ones is called a (d,k)-sequence if it does not contain runs of zeros of length either less than d or greater than k, where d and k are arbitrary, but fixed, non-negative integers and d

Full Text: PDF PostScript