@article{SeidlManethKemper:JACM:2018,
Address = {New York, NY, USA},
Author = {Seidl, Helmut and Maneth, Sebastian and Kemper, Gregor},
File = {Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable - 3182653 - l.pdf},
ISSN = {0004-5411},
Journal = {J. ACM},
Keywords = {tree-to-string transducer, decidability, equivalence problem, macro tree transducer, polynomial ideals, readme},
Month = {April},
Number = {4},
Pages = {21:1--21:30},
Publisher = {ACM},
Title = {Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable},
URL = {http://doi.acm.org/10.1145/3182653},
Volume = {65},
Year = {2018},
acmid = {3182653},
articleno = {21},
bdsk-url-1 = {http://doi.acm.org/10.1145/3182653},
bdsk-url-2 = {https://doi.org/10.1145/3182653},
date-added = {2018-06-29 14:58:04 +0000},
date-modified = {2021-01-05 11:57:44 +0100},
file-2 = {Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable - l.pdf},
issue_date = {April 2018},
numpages = {30},
doi = {10.1145/3182653}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A