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
An algebraic characterisation of Eve-positional languages
Thomas Colcombet, Olivier Idir
We present a new algebraic characterisation of Eve-positionality for -regular languages. It involves only a limited number of elementary local properties to be checked. An …
cs.FL2024
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism
Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow +1
We study transformations of automata and games using Muller conditions into equivalent ones using parity or Rabin conditions. We present two transformations, one that turns a deter…