5 citations · 7 across the 7 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2023
Checking in Polynomial Time whether or not a Regular Tree Language is Deterministic Top-Down
Sebastian Maneth, Helmut Seidl
It is well known that for a given bottom-up tree automaton it can be decided whether or not there exists deterministic top-down tree automaton that recognized the same tree languag…
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.