@InProceedings{bojanczyk_et_al:LIPIcs.MFCS.2020.19,
author = {Boja\'{n}czyk, Miko{\l}aj and Schmude, Janusz},
title = {{Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers}},
booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)},
pages = {19:1--19:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-159-7},
ISSN = {1868-8969},
year = {2020},
volume = {170},
editor = {Esparza, Javier and Kr\'{a}l', Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.19},
URN = {urn:nbn:de:0030-drops-127529},
doi = {10.4230/LIPIcs.MFCS.2020.19},
annote = {Keywords: equivalence for mso transductions, bounded treewidth, Hilbert basis theorem}
}