arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2604.24151cs.FLcs.CC
收藏

正则语法作为可识别图集的有效表示

Regular Grammars as Effective Representations of Recognizable Sets of Series-Parallel Graphs

Université Grenoble Alpes(格勒诺布尔阿尔卑斯大学)

Marius Bozga, Radu Iosif, Florian Zuleger

AI总结:

本文研究了正则语法在可识别系列-并行图集中的有效性,提出了一种更高效的有限识别代数构造,将大小限制在单指数级,改进了算法复杂度。

摘要:

系列-并行(SP)图是具有指定源和目标顶点的二元边标记图,通过串行和并行组合构建。一个图集可识别当其成员资格仅取决于其通过到有限代数的同态映射的图像。对于SP图,以及更一般地,对于树宽有界的图,可识别性等同于计数单调第二阶逻辑(CMSO)中的可定义性。尽管有这种强逻辑特征,SP图(和树宽有界的图)的可识别集的简洁性和算法有效性仍知之甚少。基于之前引入的正则语法,本文证明可识别集允许简洁有效的语法表示。主要贡献是改进了有限识别代数的构造,其大小为正则语法大小的单指数级,优于已知的双指数界。作为结果,由正则语法表示的集合的交集和语言包含问题被证明为ExpTime完全,从而改进了之前已知的2ExpTime上界。

英文摘要:

Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism into a finite algebra. For SP-graphs, and more generally, for graphs of bounded tree-width, recognizability coincides with definability in Counting Monadic Second-Order (CMSO) logic. Despite this strong logical characterization, the conciseness and algorithmic effectiveness of syntactic representations of recognizable sets of SP (and bounded-tree-width) graphs remain poorly understood. Building on previously introduced regular grammars for SP-graphs, we show that recognizable sets admit concise and effective syntactic representations. The main contribution is an improved construction of finite recognizer algebras whose size is singly-exponential in the size of a regular grammar, improving upon the previously known double-exponential bound. As a consequence, the problems of intersection and language inclusion for sets represented by regular grammars are shown to be EXPTIME-complete, thus improving on a previously known 2EXPTIME upper bound.

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

↑