Descriptive Set Theoretic Methods in Automata Theory Decidability and Topological Complexity
tarafından
 
Skrzypczak, Michał. author.

Başlık
Descriptive Set Theoretic Methods in Automata Theory Decidability and Topological Complexity

Yazar
Skrzypczak, Michał. author.

ISBN
9783662529478

Yazar
Skrzypczak, Michał. author.

Fiziksel Niteleme
XIII, 211 p. 18 illus. online resource.

Seri
Lecture Notes in Computer Science, 9802

İçindekiler
Subclasses of regular languages -- Thin algebras -- Extensions of regular languages.

Özet
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.

Konu Başlığı
Computer science.
 
Software engineering.
 
Computers.
 
Algorithms.
 
Computer logic.
 
Mathematical logic.
 
Computer science -- Mathematics.
 
Mathematical Logic and Formal Languages.
 
Logics and Meanings of Programs.
 
Computation by Abstract Devices.
 
Algorithm Analysis and Problem Complexity.
 
Discrete Mathematics in Computer Science.

Ek Kurum Yazar
SpringerLink (Online service)

Elektronik Erişim
http://dx.doi.org/10.1007/978-3-662-52947-8


Materyal TürüBarkodYer NumarasıDurumu/İade Tarihi
Electronic Book18676-1001QA8.9 -QA10.3Springer E-Book Collection