Pol(C)的一般特征
A generic characterization of Pol(C)
摘要:
我们研究了定义在正则语言类上的多项式闭包运算(C -> Pol(C))。我们提出了一个有趣的和有用的连接有关的分离问题的类C和它的多项式闭包Pol(C)的成员问题。这种联系被公式化为Pol(C)的代数特征,当C是正则语言的任意\pvari且其语句由C-分离参数化时,Pol(C)的代数特征成立。它的主要应用是从Pol(C)-隶属度到C-分离度的有效约简。因此,一旦设计了C-分离算法,这就为更复杂的类Pol(C)“免费”产生了成员资格算法。
英文摘要:
We investigate the polynomial closure operation (C -> Pol(C)) defined on classes of regular languages. We present an interesting and useful connection relating the separation problem for the class C and the membership problem for it polynomial closure Pol(C). This connection is formulated as an algebraic characterization of Pol(C) which holds when C is an arbitrary \pvari of regular languages and whose statement is parameterized by C-separation. Its main application is an effective reduction from Pol(C)-membership to C-separation. Thus, as soon as one designs a C-separation algorithm, this yields "for free" a membership algorithm for the more complex class Pol(C).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。