Descriptive Set Theoretic Methods in Automata Theory

CHF 66.35
Auf Lager
SKU
SUIIR64538K
Stock 1 Verfügbar
Geliefert zwischen Mi., 14.01.2026 und Do., 15.01.2026

Details

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.


This thesis is devoted to studying problems of automata theory from the point of view of descriptive set theory Providing effective characterisations of regular languages of infinite trees For game automata, for languages of thin trees Includes supplementary material: sn.pub/extras

Autorentext

Michä Skrzypczak completed a double degree master program in Mathematics and Computer Science at University of Warsaw. His PhD thesis, defended in December 2014, was jointly supervised by Prof. Miko aj Bojäczyk (Warsaw) and Prof. Igor Walukiewicz (Bordeaux). During the academic year 2014/2015 he was a PostDoc at IRIF in Paris, under supervision of Prof. Thomas Colcombet. Currently, Michä Skrzypczak is an assistant Professor at University of Warsaw.


Klappentext

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 Michä Skrzypczak offers certainly what we expect from excellent mathematics: new unexpected connections between a priori distinct concepts, and proofs involving enlightening ideas. Thomas Colcombet.


Inhalt
Subclasses of regular languages.- Thin algebras.- Extensions of regular languages.

Weitere Informationen

  • Allgemeine Informationen
    • GTIN 09783662529461
    • Genre Information Technology
    • Auflage 1st ed. 2016
    • Lesemotiv Verstehen
    • Anzahl Seiten 211
    • Größe H16mm x B158mm x T234mm
    • Jahr 2016
    • EAN 9783662529461
    • Format Kartonierter Einband
    • ISBN 978-3-662-52946-1
    • Titel Descriptive Set Theoretic Methods in Automata Theory
    • Autor Michal Skrzypczak
    • Untertitel Decidability and Topological Complexity
    • Gewicht 353g
    • Herausgeber Springer
    • Sprache Englisch

Bewertungen

Schreiben Sie eine Bewertung
Nur registrierte Benutzer können Bewertungen schreiben. Bitte loggen Sie sich ein oder erstellen Sie ein Konto.
Made with ♥ in Switzerland | ©2025 Avento by Gametime AG
Gametime AG | Hohlstrasse 216 | 8004 Zürich | Schweiz | UID: CHE-112.967.470