arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1903.00728cs.FL
收藏

正则关系的一元可分解性

Monadic Decomposability of Regular Relations

Pablo Barcelo, Chih-Duo Hong, Xuan-Bach Le, Anthony W. Lin, Reino Niskanen

摘要:

一元可分解性(Monadic decopsibility)-确定给定逻辑理论中的公式是否可以分解为一元公式的布尔组合的能力-是为给定逻辑理论设计决策过程的强大工具。在本文中,我们重新审视了自动机理论中的一个经典决策问题:给定一个正则(a.k.a.同步有理)关系,确定它是否是可识别的,即,它具有一元分解(即,表示为正则语言的Carnival乘积的布尔组合)。正则关系是表达形式,使用适当的字符串编码,可以捕获在Presburger算术中定义的关系。事实上,它们的表达能力与在通用自动结构中可定义的关系相一致;等价地,那些可由WS 1 S(一个后继者的弱二阶理论)中的有限集解释定义的关系。确定一个正则关系是否允许一个可识别的关系被认为是可判定的(对于二元关系来说是指数时间),但其精确的复杂性迄今为止仍然是开放的。我们的主要贡献是充分解决这个决策问题的复杂性,开发新的技术,采用无限拉姆齐理论。DFA的复杂性(NFA)表示的正规关系被证明是NLOGSPACE-完全(分别)。\PSPACE -完整)。

英文摘要:

Monadic decomposibility --- the ability to determine whether a formula in a given logical theory can be decomposed into a boolean combination of monadic formulas --- is a powerful tool for devising a decision procedure for a given logical theory. In this paper, we revisit a classical decision problem in automata theory: given a regular (a.k.a. synchronized rational) relation, determine whether it is recognizable, i.e., it has a monadic decomposition (that is, a representation as a boolean combination of cartesian products of regular languages). Regular relations are expressive formalisms which, using an appropriate string encoding, can capture relations definable in Presburger Arithmetic. In fact, their expressive power coincide with relations definable in a universal automatic structure; equivalently, those definable by finite set interpretations in WS1S (Weak Second Order Theory of One Successor). Determining whether a regular relation admits a recognizable relation was known to be decidable (and in exponential time for binary relations), but its precise complexity still hitherto remains open. Our main contribution is to fully settle the complexity of this decision problem by developing new techniques employing infinite Ramsey theory. The complexity for DFA (resp. NFA) representations of regular relations is shown to be NLOGSPACE-complete (resp. \PSPACE-complete).

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

↑