@inproceedings{haase_et_al:LIPIcs:2016:5742,
Address = {Dagstuhl, Germany},
Annote = {Keywords: language equivalence, commutative grammars, presburger arithmetic, semi-linear sets, petri nets},
Author = {Haase, Christoph and Hofman, Piotr},
BookTitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)},
Editor = {Ollinger, Nicolas and Vollmer, Heribert},
File = {Tightening the Complexity of Equivalence Problems for Commutative Grammars - Haase, Hofman (0) (0) - a - a - n.pdf},
ISBN = {978-3-95977-001-9},
ISSN = {1868-8969},
Pages = {41:1--41:14},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{Tightening the Complexity of Equivalence Problems for Commutative Grammars}},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/5742},
Volume = {47},
Year = {2016},
bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2016/5742},
bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.STACS.2016.41},
date-added = {2016-02-29 10:18:57 +0000},
date-modified = {2016-02-29 10:18:57 +0000},
urn = {urn:nbn:de:0030-drops-57422},
doi = {10.4230/LIPIcs.STACS.2016.41}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A