8 citations · 8 across the 2 of their papers we have counts for
2 papers
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…