A Complete Axiomatisation of a Fragment of Language Algebra

A Complete Axiomatisation of a Fragment of Language Algebra
复制标题

语言代数片段的完整公理化

DOI：
--
复制
发表时间：
2020
期刊：
Annual Conference for Computer Science Logic
影响因子：
--
通讯作者：
Paul Brunet
Paul Brunet
中科院分区：
--
文献类型：
--
作者：
Paul Brunet

文献摘要

被引文献

相似文献

我们考虑可逆Kleene格签名上的语言代数，即正则运算（空语言和单位语言、并并、连接和Kleene星）以及交和镜像。我们为这些代数的等式理论提供了一套完整的公理。这个证明是在证明助手Coq. 2012 ACM学科分类理论计算→代数语言理论中发展起来的
We consider algebras of languages over the signature of reversible Kleene lattices, that is the regular operations (empty and unit languages, union, concatenation and Kleene star) together with intersection and mirror image. We provide a complete set of axioms for the equational theory of these algebras. This proof was developed in the proof assistant Coq. 2012 ACM Subject Classification Theory of computation → Algebraic language theory