@inproceedings{BoiretPiorkowskiSchmude:FSTTCS:2018,
    Address = {Dagstuhl, Germany},
    Annote = {Keywords: formal language, Hilbert's basis theorem, transducers, register automata, equivalence problem, unordered trees, MSO transformations},
    Author = {Boiret, Adrien and Pi{\'o}rkowski, Radoslaw and Schmude, Janusz},
    BookTitle = {Proc. of FSTTCS'18},
    Editor = {Ganguly, Sumit and Pandya, Paritosh},
    File = {Reducing Transducer Equivalence to Register Automata Problems Solved by "Hilbert Method" - LIPIcs-FSTTCS-2018-48 - a - q.pdf},
    ISBN = {978-3-95977-093-4},
    ISSN = {1868-8969},
    Pages = {48:1--48:16},
    Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
    Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
    Title = {{Reducing Transducer Equivalence to Register Automata Problems Solved by ``Hilbert Method''}},
    URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9947},
    Volume = {122},
    Year = {2018},
    bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2018/9947},
    bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.FSTTCS.2018.48},
    date-added = {2021-01-05 12:02:09 +0100},
    date-modified = {2021-01-05 12:19:15 +0100},
    urn = {urn:nbn:de:0030-drops-99479},
    doi = {10.4230/LIPIcs.FSTTCS.2018.48}
}

@inproceedings{BoiretPiorkowskiSchmude:FSTTCS:2018, Address = {Dagstuhl, Germany}, Annote = {Keywords: formal language, Hilbert's basis theorem, transducers, register automata, equivalence problem, unordered trees, MSO transformations}, Author = {Boiret, Adrien and Pi{\'o}rkowski, Radoslaw and Schmude, Janusz}, BookTitle = {Proc. of FSTTCS'18}, Editor = {Ganguly, Sumit and Pandya, Paritosh}, File = {Reducing Transducer Equivalence to Register Automata Problems Solved by "Hilbert Method" - LIPIcs-FSTTCS-2018-48 - a - q.pdf}, ISBN = {978-3-95977-093-4}, ISSN = {1868-8969}, Pages = {48:1--48:16}, Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, Series = {Leibniz International Proceedings in Informatics (LIPIcs)}, Title = {{Reducing Transducer Equivalence to Register Automata Problems Solved by ``Hilbert Method''}}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9947}, Volume = {122}, Year = {2018}, bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2018/9947}, bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.FSTTCS.2018.48}, date-added = {2021-01-05 12:02:09 +0100}, date-modified = {2021-01-05 12:19:15 +0100}, urn = {urn:nbn:de:0030-drops-99479}, doi = {10.4230/LIPIcs.FSTTCS.2018.48} }