
























In this paper, we study the behaviour of the longest common substring for random subshifts of finite type (for dynamicists) or of the longest common substring for random sequences in random environments (for probabilists). We prove that, under some exponential mixing assumptions, this behaviour is linked to the Rényi entropy of the stationary measure. We emphasize that what we establish is a quenched result.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。