论CDAWG文法的敏感性
On the sensitivity of CDAWG-grammars
AI总结：
研究CDAWG文法对字符串编辑的敏感性，给出其最坏情况加性敏感性的下界3g-21和上界8g+4。
摘要：
字符串的紧凑有向无环词图（CDAWG）[Blumer et al. 1987]是识别字符串所有后缀的最小紧凑自动机。CDAWG可用于各种字符串任务，包括文本模式搜索、数据压缩和模式发现。CDAWG文法[Belazzougui & Cunial 2017]是一种基于CDAWG的文法文本压缩方法，它允许在不存储字符串的情况下用$O(e)$空间表示CDAWG，其中$e$表示CDAWG边的数量。设$g$为输入字符串$T$的CDAWG文法的大小。我们证明，CDAWG文法的最坏情况加性敏感性下界为$3g-21$，上界为$8g+4$。
英文摘要：
The compact directed acyclic word graph (CDAWG) [Blumer et al. 1987] of a string is the minimal compact automaton that recognizes all the suffixes of the string. CDAWGs can be used for various string tasks including text pattern searching, data compression, and pattern discovery. The CDAWG-grammar [Belazzougui & Cunial 2017] is a grammar-based text compression based on the CDAWG, which allows for representing the CDAWG in $O(e)$ space without storing the string, where $e$ denotes the number of CDAWG edges. Let $g$ be the size of the CDAWG-grammar for the input string $T$. We show that the worst-case additive sensitivity of the CDAWG-grammar is lower bounded by $3g-21$ and is upper bounded by $8 g + 4$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
