I am leading an ERC Consolidator grant on automata and logic called “A unified theory of finite-state recognisability”. The main goal is to find algebraic structures (like monoids) for things like infinite trees or profinite words. However, I can be very flexible on the topic, as long as it is tangentially connected to logic or automata.

I am searching for talented postdocs and phd students. The deadline for applications is April 30, 2017. Send applications to me by email. Please feel to ask questions before that date!

Postdocs. The postdoc can begin at any time from June 1 until the end of 2017. The duration is 6 – 12 months, with a possibility of extension for another year. The application consists of your name and 1-2 names of people who can provide references. I am looking for people with a good track record in the top conferences of the field. Teaching is optional.

PhD students. A typical duration is 4 years, starting any time from June 1 until the end of 2017. In application please include a cv and 1-2 names of people who can provide references. I am looking for candidates with a strong background in mathematics.