15 citations · 79 across the 28 of their papers we have counts for
4 papers · 1 filter
Register transducers are marble transducers
Gaëtan Douéneau-Tabot, Emmanuel Filiot, Paul Gastin
Deterministic two-way transducers define the class of regular functions from words to words. Alur and Cerný introduced an equivalent model of transducers with registers called copy…
The Adversarial Stackelberg Value in Quantitative Games
Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin
In this paper, we study the notion of adversarial Stackelberg value for two-player non-zero sum games played on bi-weighted graphs with the mean-payoff and the discounted sum funct…
On Computability of Data Word Functions Defined by Transducers
Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier
In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data omega-words). The notion of computability is define…
Alternating Tree Automata with Qualitative Semantics
Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot +7
We study alternating automata with qualitative semantics over infinite binary trees: alternation means that two opposing players construct a decoration of the input tree called a r…