Cantitate/Preț
Produs

Descriptive Set Theoretic Methods in Automata Theory: Decidability and Topological Complexity: Lecture Notes in Computer Science, cartea 9802

Autor Michał Skrzypczak
en Limba Engleză Paperback – 6 aug 2016
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.


Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31975 lei

Preț vechi: 39968 lei
-20% Nou

Puncte Express: 480

Preț estimativ în valută:
6120 6456$ 50100£

Carte tipărită la comandă

Livrare economică 03-17 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783662529461
ISBN-10: 3662529467
Pagini: 224
Ilustrații: XIII, 211 p. 18 illus.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.33 kg
Ediția:1st ed. 2016
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Cuprins

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

Recenzii

“The author applies, with considerable success, a breadth of methods covering descriptive set theory, automata theory, logic and even some classical set theory, to questions on ω- and tree automata. ... he has managed to present basic material and his own results in such a way as to make these developments accessible to the reader. ... should be useful for those who wish to keep in touch with recent developments in automata theory.” (Roger Villemaire, zbMATH 1375.03003, 2018)

“The book shows how various techniques from descriptive set theory and logic can be effectively used in the study and understanding of automata theory. The interplay between topological and automata-theoretic methods is presented very nicely and should be useful to researchers in this area.” (Rana Barua, Mathematical Reviews, September, 2017)

Notă biografică

Michał 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 Bojań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, Michał Skrzypczak is an assistant Professor at University of Warsaw.

Caracteristici

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