@InProceedings{haase_et_al:LIPIcs.STACS.2016.41,
author = {Haase, Christoph and Hofman, Piotr},
title = {{Tightening the Complexity of Equivalence Problems for Commutative Grammars}},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)},
pages = {41:1--41:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-001-9},
ISSN = {1868-8969},
year = {2016},
volume = {47},
editor = {Ollinger, Nicolas and Vollmer, Heribert},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.41},
URN = {urn:nbn:de:0030-drops-57422},
doi = {10.4230/LIPIcs.STACS.2016.41},
annote = {Keywords: language equivalence, commutative grammars, presburger arithmetic, semi-linear sets, petri nets}
}