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