A is a set of positions in a word such that each distinct factor has an occurrence crossing a position from the set. This definition comes from the data compression field, where the size of a smallest string attractor represents a lower bound for the output size of a large family of string compressors exploiting repetitions in words, including BWT-based and LZ-based compressors. For finite words, the combinatorial properties of string attractors have been studied in 2021 by Mantaci et al.. Later, Schaeffer and Shallit introduced the , a complexity function that evaluates for each the size of the length- prefix of a one-sided infinite word.

中文翻译：

---

针对无限单词的新的基于字符串吸引子的复杂性


A 是单词中的一组位置，使得每个不同的因素都出现在该组的位置上。该定义来自数据压缩领域，其中最小字符串吸引子的大小代表利用单词重复的一大串字符串压缩器（包括基于 BWT 和基于 LZ 的压缩器）的输出大小的下限。对于有限词，Mantaci 等人于 2021 年研究了字符串吸引子的组合属性。后来，Schaeffer 和 Shallit 引入了 ，这是一种复杂性函数，用于评估单边无限词的每个长度前缀的大小。