The k-prefix-free, k-suffix-free and k-infix-free languages generalize the prefix-free, suffix-free and infix-free languages by allowing marginal errors. For example, a string x in a k-prefix-free language L can be a prefix of up to k different strings in L. We also define finitely prefix-free languages in which a string x can be a prefix of finitely many strings. We present efficient algorithms that determine whether or not a given regular language is k-prefix-free, k-suffix-free or k-infix-free, and analyze the time complexity of the algorithms. We establish undecidability results for deciding these properties for (linear) context-free languages.

中文翻译：

---

具有边际错误的代码语言的推广

这ķ-无前缀，ķ-无后缀和ķ-infix-free 语言通过允许边际错误来概括无前缀、无后缀和无中缀的语言。例如，一个字符串X在一个ķ-无前缀语言大号可以是最多的前缀ķ不同的字符串大号. 我们还定义了有限无前缀语言，其中字符串X可以是有限多个字符串的前缀。我们提出了有效的算法来确定给定的常规语言是否是ķ-无前缀，ķ-无后缀或ķ-infix-free，并分析算法的时间复杂度。我们建立了不确定性结果来决定（线性）上下文无关语言的这些属性。