正则语言的子序列和后缀有效可分性
Efficient Separability of Regular Languages by Subsequences and Suffixes
摘要：
什么时候两个正则词语言K和L可以被一个简单语言分开？我们调查这个问题，并考虑分离分段和后缀可测试的语言及其变体。我们给出了两种语言可以分离的特征，并概述了当这些问题可以在多项式时间决定，如果K和L是由非确定性自动机。
英文摘要：
When can two regular word languages K and L be separated by a simple language? We investigate this question and consider separation by piecewise- and suffix-testable languages and variants thereof. We give characterizations of when two languages can be separated and present an overview of when these problems can be decided in polynomial time if K and L are given by nondeterministic automata.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
