Descriptive Set Theoretic Methods in Automata Theory : Decidability and Topological Complexity

Micha¿ Skrzypczak

ISBN 10: 3662529467 / ISBN 13: 9783662529461

Published by Springer, Springer, 2016

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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.

Seller Inventory # 9783662529461

Bibliographic Details

• Title: Descriptive Set Theoretic Methods in Automata Theory : Decidability and Topological Complexity
• Publisher: Springer, Springer
• Publication Date: 2016
• Language: English
• ISBN 10: 3662529467
• ISBN 13: 9783662529461
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 13D millimeters 235 millimeters width by 155 millimeters height by 13 millimeters depth
• Weight: 353 grams

About this title

Synopsis

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.

About the Author

Michał 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. Mikołaj Bojańczyk (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, Michał Skrzypczak is an assistant Professor at University of Warsaw.