arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2210.00946cs.FL
收藏

一阶逻辑分离的一般多项式时间方法

A generic polynomial time approach to separation by first-order logic without quantifier alternation

Thomas Place, Marc Zeitoun

摘要:

我们来看看与一阶逻辑B 1的片段相关的语言类,它不允许量词交替。每个类都是通过选择可能使用的位置上的谓词集来定义的。两个关键的片段是那些配备了线性排序和可能的后继关系。已知这两个变体具有可判定的成员关系:“输入的正则语言属于类吗?".我们依赖于运算符BPol对BPol 1的描述:给定一个输入类C,它输出一个类BPol(C),它对应于BPol 1的一个变体,该变体配备了与C相关的特殊谓词。我们在两个正交的方向上推广这些结果。首先,我们使用两种输入:组语言的类G(即,由DFA识别,其中每个字母引起状态的排列)及其扩展,写作G+。类BPol(G)和BPol(G+)捕获了BPol 1的许多变体,这些变体使用谓词,例如线性排序、后继、模谓词或字母模谓词。第二,代替成员,我们探索更一般的分离问题:决定两个正则语言是否可以被所研究的类中的一种语言分离。当BPol(G)和BPol(G+)是可判定的时,我们证明了这是可判定的.这对于BPol(G)和两个特定类别BPol(G+)是已知的。然而,这些算法是间接的,依赖于相关的框架,产生了很差的复杂度上限。我们的方法是直接的。我们使用基本概念(主要是有限自动机)。我们的主要贡献在于多项式时间图灵约简从BPol(G)-和BPol(G+)-分离到G-分离。这就产生了B_1的关键变体的多项式算法,包括那些配备了线性排序和可能的后继和/或模块谓词的多项式算法。

英文摘要:

We look at classes of languages associated to the fragment of first-order logic BΣ1 which disallows quantifier alternations. Each class is defined by choosing the set of predicates on positions that may be used. Two key such fragments are those equipped with the linear ordering and possibly the successor relation. It is known that these two variants have decidable membership: "does an input regular language belong to the class ?". We rely on a characterization of BΣ1 by the operator BPol: given an input class C, it outputs a class BPol(C) that corresponds to a variant of BΣ1 equipped with special predicates associated to C. We extend these results in two orthogonal directions. First, we use two kinds of inputs: classes G of group languages (i.e., recognized by a DFA in which each letter induces a permutation of the states) and extensions thereof, written G+. The classes BPol(G) and BPol(G+) capture many variants of BΣ1 which use predicates such as the linear ordering, the successor, the modular predicates or the alphabetic modular predicates. Second, instead of membership, we explore the more general separation problem: decide if two regular languages can be separated by a language from the class under study. We show it is decidable for BPol(G) and BPol(G+) when this is the case for G. This was known for BPol(G) and for two particular classes BPol(G+). Yet, the algorithms were indirect and relied on involved frameworks, yielding poor upper complexity bounds. Our approach is direct. We work with elementary concepts (mainly, finite automata). Our main contribution consists in polynomial time Turing reductions from both BPol(G)- and BPol(G+)-separation to G-separation. This yields polynomial algorithms for key variants of BΣ1, including those equipped with the linear ordering and possibly the successor and/or the modular predicates.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑