activity
20112023
most citedSynthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations

8 citations · 19 across the 9 of their papers we have counts for

collaborators

14 papers

cs.GT2023

On the Existence of Reactive Strategies Resilient to Delay

Martin Fränzle, Paul Kröger, Sarah Winter +1

We compare games under delayed control and delay games, two types of infinite games modelling asynchronicity in reactive synthesis. In games under delayed control both players suff…

cs.FL2023

Deterministic regular functions of infinite words

Olivier Carton, Gaëtan Douéneau-Tabot, Emmanuel Filiot +1

Regular functions of infinite words are (partial) functions realized by deterministic two-way transducers with infinite look-ahead. Equivalently, Alur et. al. have shown that they…

cs.FL2022

A Regular and Complete Notion of Delay for Streaming String Transducers

Emmanuel Filiot, Ismaël Jecker, Christof Löding +1

The notion of delay between finite transducers is a core element of numerous fundamental results of transducer theory. The goal of this work is to provide a similar notion for more…

cs.FL2022

Weak Muller Conditions Make Delay Games Hard

Sarah Winter, Martin Zimmermann

We show that solving delay games with winning conditions given by deterministic and nondeterministic weak Muller automata is 2EXPTIME-complete respectively 3EXPTIME-complete. Furth…

cs.FL2021

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…

cs.FL2021

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…