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

有限图上的树代数与互模拟不变的MSO

Tree algebras and bisimulation-invariant MSO on finite graphs

CNRS, IRIF, Université Paris Cité(法国国家科学研究中心,信息研究与交叉研究所,巴黎西岱大学);CNRS, LIP, ENS Lyon(法国国家科学研究中心,高等师范学校里昂分校计算与语言实验室)

Thomas Colcombet, Amina Doumane, Denis Kuperberg

AI总结:

该研究解决了悬而未决数十年的问题,证明有限转换系统上互模拟不变的MSO片段与模态μ演算表达等价,完善了无限树正则语言的代数理论。

摘要:

我们证明了,在有限转换系统上,MSO的互模拟不变片段在有限转换系统上与模态μ演算具有表达等价性,这一问题已悬而未决数十年。该证明将问题转化为代数框架,证明有限树代数识别的正则树语言是正则的,即可用μ演算表达。这对应于Wilke代数到无限字上ω半群的关键翻译在树中的弱形式,也是无限树正则语言代数理论中缺失了二十年的部分。

英文摘要:

We establish that the bisimulation invariant fragment of MSO over finite transition systems is expressively equivalent over finite transition systems to modal mu-calculus, a question that had remained open for several decades. The proof goes by translating the question to an algebraic framework, and showing that the languages of regular trees that are recognized by finitary tree algebras are the regular ones, ie. the ones expressible in mu-calculus. This corresponds for trees to a weak form of the key translation of Wilke algebras to omega-semigroup over infinite words, and was also a missing piece in the algebraic theory of regular languages of infinite trees for twenty years.

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

↑