2000 character limit reached
A complete axiomatisation of reversible Kleene lattices (1902.08048v1)
Published 21 Feb 2019 in cs.LO and cs.FL
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.