Showing cs.FLShow all
2 papers · 1 filter
cs.FL2025
When is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic?
Sebastian Maneth, Helmut Seidl
We consider two natural subclasses of deterministic top-down tree-to-tree transducers, namely, linear and uniform-copying transducers. For both classes we show that it is decidable…
cs.FL2024
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-…