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

EF + EX森林代数

EF+EX Forest Algebras

Andreas Krebs, Howard Straubing

摘要:

我们研究语言的无排名森林定义使用的时间运营商EF和EX。我们的语言定义的特点,在这个逻辑,及其各种片段,使用的句法森林代数介绍Bojanczyk和Walukiewicz。我们的代数刻画产生有效的算法,用于决定当一个给定的语言的森林是可定义的,在这个逻辑。证明的基础上了解几个小代数的圈积闭包,我们介绍了森林代数的一般理想理论。这结合了思想的工作Bojanczyk和Walukiewicz的类似逻辑的二叉树和早期工作的Stiffler花圈产品的有限半群。

英文摘要:

We examine languages of unranked forests definable using the temporal operators EF and EX. We characterize the languages definable in this logic, and various fragments thereof, using the syntactic forest algebras introduced by Bojanczyk and Walukiewicz. Our algebraic characterizations yield efficient algorithms for deciding when a given language of forests is definable in this logic. The proofs are based on understanding the wreath product closures of a few small algebras, for which we introduce a general ideal theory for forest algebras. This combines ideas from the work of Bojanczyk and Walukiewicz for the analogous logics on binary trees and from early work of Stiffler on wreath product of finite semigroups.

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

↑