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

• Κύριος συγγραφέας: Skrzypczak, Michał (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2016.
• Σειρά: Lecture Notes in Computer Science, 9802
• Θέματα: Computer science.; Software engineering.; Computers.; Algorithms.; Computer logic.; Mathematical logic.; Computer science > Mathematics.; Computer Science.; Mathematical Logic and Formal Languages.; Logics and Meanings of Programs.; Computation by Abstract Devices.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Software Engineering.
• Φυσική περιγραφή: XIII, 211 p. 18 illus. online resource.
• ISBN: 9783662529478
• ISSN: 0302-9743 ;

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.