Abstract
Symbolic tree transducers are programs that transform data trees with an infinite signature. In this paper, we show that the equivalence problem of deterministic symbolic top-down tree transducers (DTop) can be reduced to that of classical DTop. As a consequence the equivalence of two symbolic DTop can be decided in NExpTime, when assuming that all operations related to the processing of data values are in PTime. This result can be extended to symbolic DTop with lookahead and thus to deterministic symbolic bottom-up tree transducers.
Cite
CITATION STYLE
Hugot, V., Boiret, A., & Niehren, J. (2017). Equivalence of symbolic tree transducers. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10396 LNCS, 109–121. https://doi.org/10.1007/978-3-319-62809-7_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
