By an analogy to the duality between the recurrence time and the longest match length, we introduce a quantity dual to the maximal repetition length, which we call the repetition time. Using the generalized Kac lemma for successive recurrence times by Chen Moy, we sandwich the repetition time in terms of min-entropies with no or relatively short conditioning. The sole assumption is stationarity and ergodicity. The proof is surprisingly short and the claim is fully general in contrast to earlier approaches by Szpankowski and by D\k{e}bowski. We discuss the analogy of this result with the Wyner-Ziv/Ornstein-Weiss theorem, which sandwiches the recurrence time in terms of Shannon entropies. We formulate the respective sandwich bounds in a way that applies also to the case of stretched exponential growth observed empirically for natural language.

翻译：暂无翻译