The neighbourhood of a regular language with respect to the prefix, suffix and subword distance is always regular and a tight bound for the state complexity of prefix distance neighbourhoods is known. We give upper bounds for the state complexity of the neighbourhood of radius [Formula: see text] of an [Formula: see text]-state deterministic finite automaton language with respect to the suffix distance and the subword distance, respectively. For restricted values of [Formula: see text] and [Formula: see text] we give a matching lower bound for the state complexity of suffix distance neighbourhoods.

中文翻译：

---

后缀距离的状态复杂度

关于前缀、后缀和子词距离的常规语言的邻域始终是正则的，并且前缀距离邻域的状态复杂度的紧密界限是已知的。我们给出了[公式：见文本]状态确定性有限自动机语言的半径[公式：见文本]邻域的状态复杂度的上限，分别关于后缀距离和子词距离。对于 [Formula: see text] 和 [Formula: see text] 的受限值，我们为后缀距离邻域的状态复杂度提供匹配的下限。