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

Kleene代数

Kleene Algebra

Tobias Kappé, Alexandra Silva, Jana Wagemaker

AI总结:

本入门小册子介绍可用于研究程序等价性的Kleene代数,讲解其正则表达式程序建模、与自动机的对应关系及核心等价性判定结论,配套习题与余代数视角的可选自动机章节辅助理解。

摘要:

本小册子是Kleene代数(KA)的入门材料,KA是一套可用于研究程序间通用等价性的定律集合。书中探讨了如何使用正则表达式对通用程序建模、这些表达式如何与自动机对应,以及如何利用该对应关系得到KA的核心结论:正则表达式的等价性成立,当且仅当它可通过KA的定律证明。每章末尾配有一组习题以进一步建立直觉、加深理解,另有一个可选章节从余代数视角展开自动机理论的介绍。

英文摘要:

This booklet serves as an introduction to Kleene Algebra (KA), a set of laws that can be used to study general equivalences between programs. It discusses how general programs can be modeled using regular expressions, how those expressions correspond to automata, and how this correspondence can be exploited to obtain the central result of KA, namely that an equivalence of regular expressions is true if and only if it can be proved using the laws of KA. Each chapter closes with a set of exercises to further build intuition and understanding, and there is an optional chapter that develops automata theory through the lens of coalgebra.

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

↑