Weak Kleene Algebra is Sound and (Possibly) Complete for Simulation
Logic in Computer Science
2009-10-07 v1 Programming Languages
Abstract
We show that the axioms of Weak Kleene Algebra (WKA) are sound and complete for the theory of regular expressions modulo simulation equivalence, assuming their completeness for monodic trees (as conjectured by Takai and Furusawa).
Cite
@article{arxiv.0910.1028,
title = {Weak Kleene Algebra is Sound and (Possibly) Complete for Simulation},
author = {Ernie Cohen},
journal= {arXiv preprint arXiv:0910.1028},
year = {2009}
}
Comments
12 pages, 9 references