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

By: Skrzypczak, Michał [author.]Contributor(s): SpringerLink (Online service)Material type: TextTextSeries: Theoretical Computer Science and General Issues ; 9802 | Lecture Notes in Computer Science ; 9802Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2016Edition: 1st ed. 2016Description: XIII, 211 p. 18 illus. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783662529478Subject(s): Mathematical logic | Computer logic | Computers | Algorithms | Computer science—Mathematics | Software engineering | Mathematical Logic and Formal Languages | Logics and Meanings of Programs | Computation by Abstract Devices | Algorithm Analysis and Problem Complexity | Discrete Mathematics in Computer Science | Software EngineeringAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 005.131 LOC classification: QA8.9-10.3Online resources: Click here to access online
Contents:
Subclasses of regular languages -- Thin algebras -- Extensions of regular languages.
In: Springer Nature eBookSummary: 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.
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK13911

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

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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha