TY  - BOOK
AU  - Skrzypczak,Micha?.
ED  - SpringerLink (Online service)
TI  - Descriptive Set Theoretic Methods in Automata Theory: Decidability and Topological Complexity 
T2  - Lecture Notes in Computer Science,
SN  - 9783662529478
AV  - QA8.9-QA10.3 
U1  - 005.131 23
PY  - 2016///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg, Imprint: Springer
KW  - Computer science
KW  - Software engineering
KW  - Computers
KW  - Algorithms
KW  - Computer logic
KW  - Mathematical logic
KW  - Mathematics
KW  - Computer Science
KW  - Mathematical Logic and Formal Languages
KW  - Logics and Meanings of Programs
KW  - Computation by Abstract Devices
KW  - Algorithm Analysis and Problem Complexity
KW  - Discrete Mathematics in Computer Science
KW  - Software Engineering
N1  - Subclasses of regular languages -- Thin algebras -- Extensions of regular languages
N2  - 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
UR  - http://148.231.10.114:2048/login?url=http://dx.doi.org/10.1007/978-3-662-52947-8
ER  -