Left-Handed Completeness for Kleene algebra, via Cyclic Proofs
Work
Year: 2018
Type: article
Abstract: We give a new proof that the axioms of left-handed Kleene algebra are complete with respect to language containments. This proof is significantly simpler than both the proof of Boffa (which relies on ... more
Source: EPiC series in computing
Authors Anupam Das, Amina Doumane, Damien Pous
Institutions University of Copenhagen, Université Claude Bernard Lyon 1, École Normale Supérieure de Lyon, Centre National de la Recherche Scientifique
Cites: 26
Cited by: 11
Related to: 10
FWCI: 0.803
Citation percentile (by year/subfield): 86.46
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze