3 papers
cs.FL2023
Deciding whether an Attributed Translation can be realized by a Top-Down Transducer
Sebastian Maneth, Martin Vu
We prove that for a given partial functional attributed tree transducer with monadic output, it is decidable whether or not an equivalent top-down transducer (with or without look-…
cs.FL2022
How to decide Functionality of Compositions of Top-Down Tree Transducers
Sebastian Maneth, Helmut Seidl, Martin Vu
We prove that functionality of compositions of top-down tree transducers is decidable by reducing the problem to the functionality of one top-down tree transducer with look-ahead.
cs.FL2021
Definability Results for Top-Down Tree Transducers
Sebastian Maneth, Helmut Seidl, Martin Vu
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…