@inproceedings{BojanczykSchmude:MFCS:2020,
Address = {Dagstuhl, Germany},
Annote = {Keywords: equivalence for mso transductions, bounded treewidth, Hilbert basis theorem},
Author = {Boja{\'n}czyk, Miko{{\l}}aj and Schmude, Janusz},
BookTitle = {Proc. of MFCS'20},
Editor = {Esparza, Javier and Kr{\'a}{\v l}, Daniel},
File = {Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers - LIPIcs-MFCS-2020-19 - a - n.pdf},
ISBN = {978-3-95977-159-7},
ISSN = {1868-8969},
Pages = {19:1--19:14},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
Series = {LIPIcs},
Title = {{Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers}},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12752},
Volume = {170},
Year = {2020},
bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2020/12752},
bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.MFCS.2020.19},
date-added = {2020-08-22 15:10:31 +0200},
date-modified = {2020-09-17 16:36:54 +0200},
urn = {urn:nbn:de:0030-drops-127529},
doi = {10.4230/LIPIcs.MFCS.2020.19}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 07:51:09,
Build Time: N/A