The book is based on the PhD thesis “Descriptive Set Theoretic Methods in Automata Theory,” awarded the E.W. Beth Prize in 2015 for outstanding dissertations in the fields of logic, language, and information. The thesis reveals unexpected connections between advanced concepts in logic, descriptive set theory, topology, and automata theory and provides many deep insights into the interplay between these fields. It opens new perspectives on central problems in the theory of automata on infinite words and trees and offers very impressive advances in this theory from the point of view of topology.
"…the thesis of Michał Skrzypczak offers certainly what we expect from excellent mathematics: new unexpected connections between a priori distinct concepts, and proofs involving enlightening ideas.” Thomas Colcombet.
Michał Skrzypczak
automata decidability descriptive complexity regular languages topological methods algorithm analysis and problem complexity
“The author applies, with considerable success, a breadth of methods covering descriptive set theory, automata theory, logic and even some classical set theory, to questions on ω- and tree automata. ... he has managed to present basic material and his own results in such a way as to make these developments accessible to the reader. ... should be useful for those who wish to keep in touch with recent developments in automata theory.” (Roger Villemaire, zbMATH 1375.03003, 2018)