@article{doi:10.1142/S0129054115400134,
Abstract = {The decidability of equivalence for three important classes of tree transducers is discussed. Each class can be obtained as a natural restriction of deterministic macro tree transducers (MTTs): (1) no context parameters, i.e., top-down tree transducers, (2) linear size increase, i.e., MSO definable tree transducers, and (3) monadic input and output ranked alphabets. For the full class of mtts, decidability of equivalence remains a long-standing open problem.},
Author = {Maneth, Sebastian},
EPrint = {https://doi.org/10.1142/S0129054115400134},
File = {A Survey on Decidable Equivalence Problems for Tree Transducers - maneth2015.pdf},
Journal = {International Journal of Foundations of Computer Science},
Number = {08},
Pages = {1069-1100},
Title = {A Survey on Decidable Equivalence Problems for Tree Transducers},
URL = {https://doi.org/10.1142/S0129054115400134},
Volume = {26},
Year = {2015},
bdsk-url-1 = {https://doi.org/10.1142/S0129054115400134},
date-added = {2022-03-11 16:12:43 +0100},
date-modified = {2022-03-11 16:12:43 +0100},
doi = {10.1142/S0129054115400134}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A