Descriptive Set Theoretic Methods in Automata Theory [electronic resource] : Decidability and Topological Complexity / by Micha� Skrzypczak.
By: Skrzypczak, Micha� [author.].
Contributor(s): SpringerLink (Online service).
Material type: BookSeries: Lecture Notes in Computer Science: 9802Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2016Description: XIII, 211 p. 18 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783662529478.Subject(s): 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 EngineeringAdditional physical formats: Printed edition:: No titleDDC classification: 005.131 Online resources: Click here to access onlineSubclasses of regular languages -- Thin algebras -- Extensions of regular languages.
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.
There are no comments for this item.