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

• Autore: Skrzypczak Michał
• Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016
• Edizione: 1st ed. 2016.
• Descrizione fisica: 1 online resource (XIII, 211 p. 18 illus.)
• Disciplina: 511.322
• Soggetto topico: Machine theory; Computer science; Algorithms; Computer science—Mathematics; Discrete mathematics; Software engineering; Formal Languages and Automata Theory; Computer Science Logic and Foundations of Programming; Theory of Computation; Discrete Mathematics in Computer Science; Software Engineering
• Nota di contenuto: Subclasses of regular languages -- Thin algebras -- Extensions of regular languages.
• Sommario/riassunto: 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.
• Titolo autorizzato: Descriptive Set Theoretic Methods in Automata Theory
• ISBN: 3-662-52947-5
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 996465309703316
• Lo trovi qui: Univ. di Salerno
• Serie: Theoretical Computer Science and General Issues, . 2512-2029 ; ; 9802