8 citations · 8 across the 3 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2024
On the Boolean Closure of Deterministic Top-Down Tree Automata
Christof Löding, Wolfgang Thomas
The class of Boolean combinations of tree languages recognized by deterministic top-down tree automata (also known as deterministic root-to-frontier automata) is studied. The probl…
cs.FL2014★ 8 cited
Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations
Christof Löding, Sarah Winter
We consider the synthesis of deterministic tree transducers from automaton definable specifications, given as binary relations, over finite trees. We consider the case of specifica…
cs.FL2014
Decision Problems for Deterministic Pushdown Automata on Infinite Words
Christof Löding
The article surveys some decidability results for DPDAs on infinite words (omega-DPDA). We summarize some recent results on the decidability of the regularity and the equivalence p…