Definability Results for Top-Down Tree Transducers
Formal Languages and Automata Theory
2021-06-01 v1
Abstract
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.
Cite
@article{arxiv.2105.14860,
title = {Definability Results for Top-Down Tree Transducers},
author = {Sebastian Maneth and Helmut Seidl and Martin Vu},
journal= {arXiv preprint arXiv:2105.14860},
year = {2021}
}