10 citations · 32 across the 19 of their papers we have counts for
5 papers · 1 filter
Expregular functions
Thomas Colcombet, Nathan Lhote, Pierre Ohlmann
Polyregular functions form a robust class of string-to-string functions with polynomial growth, as evidenced by Bojanczyk (2018). This class admits numerous descriptions and enjoys…
Positional -regular languages
Antonio Casares, Pierre Ohlmann
In the context of two-player games over graphs, a language is called positional if, in all games using as winning objective, the protagonist can play optimally using positi…
Characterising memory in infinite games
Antonio Casares, Pierre Ohlmann
This paper is concerned with games of infinite duration played over potentially infinite graphs. Recently, Ohlmann (LICS 2022) presented a characterisation of objectives admitting…
The Theory of Universal Graphs for Infinite Duration Games
Thomas Colcombet, Nathanaël Fijalkow, Paweł Gawrychowski +1
We introduce the notion of universal graphs as a tool for constructing algorithms solving games of infinite duration such as parity games and mean payoff games. In the first part w…
Controlling a random population
Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann
Bertrand et al. introduced a model of parameterised systems, where each agent is represented by a finite state system, and studied the following control problem: for any number of…