Pour le prochain séminaire de l’équipe Cosynus, nous aurons le plaisir d’accueillir Robin Piedeleu qui nous parlera d’une approche diagrammatique pour l’équivalence des automates.

Le seminaire sera en ligne: https://webconf.math.cnrs.fr/b/sam-tq6-hwg

Résumé : In this talk I will present a fully diagrammatic approach to the theory of finite-state automata, based on reinterpreting their usual state-transition graphs as string diagrams. Moreover, I will give an equational theory that completely axiomatises language equivalence in this new setting. The proposed axiomatisation is finitary— a result which is provably impossible to obtain for the usual one-dimensional syntax of regular expressions.