research
∙
02/13/2023
Deterministic regular functions of infinite words
Regular functions of infinite words are (partial) functions realized by ...
share
research
∙
01/25/2023
LTL Reactive Synthesis with a Few Hints
We study a variant of the problem of synthesizing Mealy machines that en...
research
∙
03/09/2021
Continuous Uniformization of Rational Relations and Synthesis of Computable Functions
A uniformizer of a binary relation is a function whose graph is containe...
research
∙
03/09/2021
Synthesis from Weighted Specifications with Partial Domains over Finite Words
In this paper, we investigate the synthesis problem of terminating react...
research
∙
01/18/2021
Computability of Data-Word Transductions over Different Data Domains
In this paper, we investigate the problem of synthesizing computable fun...
research
∙
04/27/2020
The Adversarial Stackelberg Value in Quantitative Games
In this paper, we study the notion of adversarial Stackelberg value for ...
research
∙
02/19/2020
On Computability of Data Word Functions Defined by Transducers
In this paper, we investigate the problem of synthesizing computable fun...
research
∙
02/10/2020
Alternating Tree Automata with Qualitative Semantics
We study alternating automata with qualitative semantics over infinite b...
research
∙
01/14/2019