%0 Conference Paper %1 conf/stacs/BojanczykH07 %A Bojanczyk, Mikolaj %A Hoffman, Piotr %B STACS %D 2007 %E Thomas, Wolfgang %E Weil, Pascal %I Springer %K dblp %P 622-633 %T Reachability in Unions of Commutative Rewriting Systems Is Decidable. %U http://dblp.uni-trier.de/db/conf/stacs/stacs2007.html#BojanczykH07 %V 4393 %@ 978-3-540-70917-6

@inproceedings{conf/stacs/BojanczykH07, added-at = {2017-05-26T00:00:00.000+0200}, author = {Bojanczyk, Mikolaj and Hoffman, Piotr}, biburl = {https://www.bibsonomy.org/bibtex/23196cc79fb73010382afa0f76ef0305e/dblp}, booktitle = {STACS}, crossref = {conf/stacs/2007}, editor = {Thomas, Wolfgang and Weil, Pascal}, ee = {https://doi.org/10.1007/978-3-540-70918-3_53}, interhash = {40c367cbda5c55b2960141c45ced075b}, intrahash = {3196cc79fb73010382afa0f76ef0305e}, isbn = {978-3-540-70917-6}, keywords = {dblp}, pages = {622-633}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T15:25:40.000+0200}, title = {Reachability in Unions of Commutative Rewriting Systems Is Decidable.}, url = {http://dblp.uni-trier.de/db/conf/stacs/stacs2007.html#BojanczykH07}, volume = 4393, year = 2007 }