Descriptive Set Theoretic Methods in Automata Theory : Decidability and Topological Complexity / by Michał Skrzypczak

By:

Skrzypczak, Michał [aut]

Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: SpringerLink Bücher | Springer eBook Collection Computer Science | Lecture notes in computer science ; 9802Publisher: Berlin, Heidelberg : Springer, 2016Description: Online-Ressource (XIII, 211 p. 18 illus, online resource)ISBN:

9783662529478

Subject(s):

Additional physical formats: 9783662529461 | Druckausg.: 978-3-662-52946-1 | Printed edition: 9783662529461 MSC: MSC: *03-02 | 03D05 | 03E15 | 68Q45 | 68Q70LOC classification:

QA8.9-QA10.3

DOI: DOI: 10.1007/978-3-662-52947-8Online resources:

Summary: 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 ColcombetSummary: Subclasses of regular languages -- Thin algebras -- Extensions of regular languagesPPN: PPN: 1658654919Package identifier: Produktsigel: ZDB-2-LNC | ZDB-2-SCS | ZDB-2-SEB | ZDB-2-SXCS | ZDB-2-SEB

Holdings ( 0 )

No physical items for this record