Reachability in Unions of Commutative Rewriting Systems Is Decidable.

Mikolaj Bojanczyk, Piotr Hoffman

Browse the full STACS paper archive.