在随机数据中找到固定模式的概率单调地依赖于bifix指示符
The probability of finding a fixed pattern in random data depends monotonically on the bifix indicator
摘要:
我们考虑的问题,找到一个固定的L-元序列中的随机L-元数据流。已知期望搜索时间是模式的分叉长度的严格递增函数。本文证明了在有限随机字中找到模式的概率是该模式的双叉长度的严格减函数。
英文摘要:
We consider the problem of finding a fixed L-ary sequence in a stream of random L-ary data. It is known that the expected search time is a strictly increasing function of the lengths of the bifices of the pattern. In this paper we prove the related statement that the probability of finding the pattern in a finite random word is a strictly decreasing function of the lengths of the bifices of the pattern.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。