在线回溯重复检测
Online Detection of Repetitions with Backtracking
摘要：
在本文中，我们提出了两个算法，以下问题：给定一个字符串和一个合理的$e > 1$，检测在网上的时尚最早出现的重复指数$\ge e$在字符串中。1.第一个算法支持回溯操作，删除输入字符串的最后一个字母。此解决方案在$O(n\log m)$时间和$O(m)$空间中运行，其中$m$是在执行给定序列的$n$读取和回溯操作期间生成的字符串的最大长度。2.第二种算法在$O(n\logσ)$时间和$O(n)$空间中工作，其中$n$是输入字符串的长度，$σ$是不同字母的数量。该算法相对简单，在相同的工作时间和空间下，比以前已知的解决方案需要更少的内存。在执行给定序列的$n$读取和回溯操作期间生成的字符串。
英文摘要：
In this paper we present two algorithms for the following problem: given a string and a rational $e > 1$, detect in the online fashion the earliest occurrence of a repetition of exponent $\ge e$ in the string. 1. The first algorithm supports the backtrack operation removing the last letter of the input string. This solution runs in $O(n\log m)$ time and $O(m)$ space, where $m$ is the maximal length of a string generated during the execution of a given sequence of $n$ read and backtrack operations. 2. The second algorithm works in $O(n\logσ)$ time and $O(n)$ space, where $n$ is the length of the input string and $σ$ is the number of distinct letters. This algorithm is relatively simple and requires much less memory than the previously known solution with the same working time and space. a string generated during the execution of a given sequence of $n$ read and backtrack operations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
