A complete axiomatisation of reversible Kleene lattices
Logic in Computer Science
2019-02-22 v1 Formal Languages and Automata Theory
Abstract
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.
Keywords
Cite
@article{arxiv.1902.08048,
title = {A complete axiomatisation of reversible Kleene lattices},
author = {Paul Brunet},
journal= {arXiv preprint arXiv:1902.08048},
year = {2019}
}