Definability Results for Top-Down Tree Transducers [article]

Sebastian Maneth, Helmut Seidl, Martin Vu
2021 arXiv   pre-print
We prove that for a given deterministic top-down transducer with look-ahead it is decidable whether or not its translation is definable (1)~by a linear top-down tree transducer or (2)~by a tree homomorphism. We present algorithms that construct equivalent such transducers if they exist.
arXiv:2105.14860v1 fatcat:47eg2yn5drc5pmxugmowdwtngy