Mikołaj Bojańczyk


I am currently running an ERC Consolidator grant called “A unified theory of finite-state recognisability”, acronym Lipa, funded by the European Union’s Horizon 2020 research and innovation programme (grant agreement No 683080).

The project duration is May 2016 – April 2021.



The goal of the project is to develop a general theory of “recognisable languages”. The unifying terminology can be monads, but there are specific technical questions, e.g. what is a recognisable language for graphs, or for infinite trees. Broadly speaking, I am interested in the automata-logic-algebra connections, as exemplified by the Büchi Theorem (on equivalence of mso and \omega-automata) and the Schützenberger Theorem (on equivalence of fo and aperiodic monoids).

Here is a summer school organised by the project.



I am always looking out for talented postdocs, with a publication history in the top conferences for logic in computer science (LICS, ICALP, STACS, …). If you are interested, please let me know. Also periodically I publish calls for positions (last one), including phd positions.

So far, the following people have been working with the project for longer periods: