3 results
Thomas Colcombet ; Daniela Petrişan.
In this paper we regard languages and their acceptors - such as deterministic or weighted automata, transducers, or monoids - as functors from input categories that specify the type of the languages and of the machines to categories that specify the type of outputs. Our results are as follows: A) […]
Published on March 23, 2020
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 agents, does there exist a controller able to bring all agents to a target state? They showed that the problem is […]
Published on November 24, 2021
Thomas Colcombet ; Nathanaël Fijalkow ; Florian Horn.
We consider two-player games over graphs and give tight bounds on the memory size of strategies ensuring safety objectives. More specifically, we show that the minimal number of memory states of a strategy ensuring a safety objective is given by the size of the maximal antichain of left quotients […]
Published on January 29, 2024