6 citations · 7 across the 2 of their papers we have counts for
4 papers
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…
Uniformization Problems for Synchronizations of Automatic Relations on Words
Sarah Winter
A uniformization of a binary relation is a function that is contained in the relation and has the same domain as the relation. The synthesis problem asks for effective uniformizati…
Finite-state Strategies in Delay Games
Martin Zimmermann
What is a finite-state strategy in a delay game? We answer this surprisingly non-trivial question and present a very general framework for computing such strategies: they exist for…
On Equivalence and Uniformisation Problems for Finite Transducers
Emmanuel Filiot, Ismaël Jecker, Christof Löding +1
Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniform…