Weak Kleene Algebra is Sound and (Possibly) Complete for Simulation

Details Weak Kleene Algebra is Sound and (Possibly) Complete for Simulation Weak Kleene Algebra is Sound and (Possibly) Complete for Simulation

2009-10-06

arxiv.org/abs/0910.1028v1

Computer Science

Logic in Computer Science

12 pages, 9 references

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

Weak Kleene Algebra is Sound and (Possibly) Complete for Simulation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Weak Kleene Algebra is Sound and (Possibly) Complete for Simulation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Weak Kleene Algebra is Sound and (Possibly) Complete for Simulation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-357857