   |
|
|
||||
|
||||
|
|
|
||
|
||||
|
||||
|
||||||||||||||||||||||||||||||||||||||||||||||||
|
||||
|
|
At a very early stage of his scientific career, Mikołaj Bojańczyk has established path-breaking results in three different subjects of theoretical computer science, combining technical strength with conceptual innovations. In work with Thomas Colcombet, he clarified the computational power of the model of tree-walking automaton and solved a long-standing open problem of automata theory. Also he extended in a highly nontrivial way Rabin's theorem on the decidability of the monadic theory of infinite trees, with interesting and fresh perspectives in program verification. Finally, he developed an effective classification theory for regular sets of finite trees, giving new impetus to this classical field. All these contributions not only offer technically deep constructions but also provide excellent perspectives in their domains. Prof. Wolfgang Thomas RWTH Aachen |
|
|
|
||||
