A complete axiomatisation of reversible Kleene lattices

02/21/2019

∙

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.

READ FULL TEXT

A complete axiomatisation of reversible Kleene lattices

Symmetries in Reversible Programming: From Symmetric Rig Groupoids to Reversible Programming Languages

Certifying algorithms and relevant properties of Reversible Primitive Permutations with Lean

Complete representation by partial functions for signatures containing antidomain restriction

Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas

Binary intersection formalized

A Complete Axiom System for 1-Free Kleene Star Expressions under Bisimilarity: An Elementary Proof

"How to squash a mathematical tomato", Rubic's cube-like surfaces and their connection to reversible computation

A complete axiomatisation of reversible Kleene lattices

Related Research

Symmetries in Reversible Programming: From Symmetric Rig Groupoids to Reversible Programming Languages

Certifying algorithms and relevant properties of Reversible Primitive Permutations with Lean

Complete representation by partial functions for signatures containing antidomain restriction

Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas

Binary intersection formalized

A Complete Axiom System for 1-Free Kleene Star Expressions under Bisimilarity: An Elementary Proof

"How to squash a mathematical tomato", Rubic's cube-like surfaces and their connection to reversible computation