Showing cs.FLShow all
3 papers · 1 filter
cs.FL2026
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…
cs.FL2026★ 1 cited
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…
cs.FL2025
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…