The size of the \textit{smallest suffixient set} of positions of a string recently emerged as a new measure of string \textit{repetitiveness} -- a measure reflecting how much of repetitive content the string contains. We study how to maintain the smallest suffixient set online in near-real-time, that is with small (in our case, polyloglog) worst-case time on processing each letter. Two frameworks are considered: when the text is given letter-by-letter in either a right-to-left or left-to-right direction. Our central algorithmic tool is Weiner's suffix tree algorithm and associated algorithmic primitives for its efficient implementation.

翻译：字符串中位置的最小后缀集大小最近成为衡量字符串重复性的一种新指标——该指标反映字符串包含的重复内容程度。我们研究如何在近实时（即在处理每个字母时保持最坏情况下较小的运行时间，本文中为多对数对数级）场景下在线维护最小后缀集。考虑两种框架：文本按照从右到左或从左到右方向逐字母输入。我们核心的算法工具是Weiner的后缀树算法及其高效实现的相关算法原语。