Mikolaj Bojanczyk, Piotr Hoffman. Reachability in Unions of Commutative Rewriting Systems Is Decidable. In Wolfgang Thomas, Pascal Weil, editors, STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings. Volume 4393 of Lecture Notes in Computer Science, pages 622-633, Springer, 2007. [doi]
No references recorded for this publication.
No citations of this publication recorded.