6 citations · 7 across the 6 of their papers we have counts for
4 papers · 2 filters
Decision problems for origin-close top-down tree transducers (full version)
Sarah Winter
Tree transductions are binary relations of finite trees. For tree transductions defined by non-deterministic top-down tree transducers, inclusion, equivalence and synthesis problem…
Resynchronized Uniformization and Definability Problems for Rational Relations
Christof Löding, Sarah Winter
Regular synchronization languages can be used to define rational relations of finite words, and to characterize subclasses of rational relations, like automatic or recognizable rel…
Synthesis from Weighted Specifications with Partial Domains over Finite Words
Emmanuel Filiot, Christof Löding, Sarah Winter
In this paper, we investigate the synthesis problem of terminating reactive systems from quantitative specifications. Such systems are modeled as finite transducers whose execution…
Synthesizing Computable Functions from Rational Specifications over Infinite Words
Emmanuel Filiot, Sarah Winter
The synthesis problem asks to automatically generate, if it exists, an algorithm from a specification of correct input-output pairs. In this paper, we consider the synthesis of com…