{"id":1353,"date":"2017-05-17T10:15:19","date_gmt":"2017-05-17T08:15:19","guid":{"rendered":"https:\/\/www.mimuw.edu.pl\/~bojan\/?page_id=1353"},"modified":"2018-12-31T11:09:47","modified_gmt":"2018-12-31T10:09:47","slug":"lipa","status":"publish","type":"page","link":"https:\/\/www.mimuw.edu.pl\/~bojan\/lipa","title":{"rendered":"Lipa"},"content":{"rendered":"

\"\"<\/a><\/p>\n

I am currently running an ERC Consolidator grant called “A unified theory of finite-state recognisability”, acronym Lipa, <\/em>funded by\u00a0the European Union\u2019s Horizon 2020 research and innovation programme (grant agreement No 683080<\/a>).<\/p>\n

The project duration is May 2016 – April 2021.<\/p>\n

 <\/p>\n

Topic<\/h3>\n

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

 <\/p>\n

Summer schools<\/h3>\n

Here is a summer school<\/a> organised by the project, and another one<\/a>.<\/p>\n

 <\/p>\n

Positions<\/h3>\n

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<\/a>), including phd positions.<\/p>\n

So far, the following people have been working with the project for longer periods:<\/p>\n