Descriptive Set Theoretic Methods in Automata Theory

Decidability and Topological Complexity
1. Auflage 2016
ISBN: 978-3-662-52946-1
Verlag: Springer

Buch, Englisch, 211 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 3518 g

Reihe: Lecture Notes in Computer Science

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 Michal Skrzypczak offers certainly what we expect from excellent mathematics: new unexpected connections between a priori distinct concepts, and proofs involving enlightening ideas.” Thomas Colcombet.

Zielgruppe

Research

Autoren/Hrsg.

Skrzypczak, Micha¿

Skrzypczak, Michal

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten

Inhaltsverzeichnis

Subclasses of regular languages.- Thin algebras.- Extensions of regular languages.

Über Autor(innen)

Michal Skrzypczak completed a double degree master program in Mathematics and Computer Science at University of Warsaw. His PhD thesis, defended in December 2014, was jointly supervised by Prof. Mikolaj Bojanczyk (Warsaw) and Prof. Igor Walukiewicz (Bordeaux). During the academic year 2014/2015 he was a PostDoc at IRIF in Paris, under supervision of Prof. Thomas Colcombet. Currently, Michal Skrzypczak is an assistant Professor at University of Warsaw.