Mikołaj Bojańczyk works on foundations of computer science at the University of Warsaw, where – true to the local tradition of low mobility – he has been since his undergraduate studies. He is mainly interested in finite model theory and algebraic language theory, but most of all in the interplay between automata and logic. The automata are usually finite state, but may process more fancy objects than words, like graphs or infinite trees. The logic is typically some variant of monadic second-order logic.
- Logical Structures in Computation, Fall 2016. Visiting Scientist.