top of page
Research
Talks
A selection of some talks I have given in the past years.
In this talk, I propose a syntax of regular expressions, whose languages are graphs of tree width 2. Then I show that these languages correspond exactly to MSO definable languages of graphs of tree width 2.
A talk I gave at Chocola in March 2020, where I review some decidability and axiomatizability results about relation algebra, and where I give some new non-axiomatizability results.
A talk I gave at LICS 2020 where I present a syntax of regular expressions generating exactly those first-order tree-to-tree functions.
bottom of page