Figure 6.

Simulation of the probability-dependent upper bound $c\left(l,p\right)$ for binary sequences of fixed length $l=100$ with various probability parameters $P\left(X=1\right)$. For every $P\left(X=1\right)$, one thousand binary sequences of length l are generated. Error bars represent the maximum, minimum, and average number of distinct phrases.