Cargando…

Descriptive Set Theoretic Methods in Automata Theory Decidability and Topological Complexity /

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, des...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Skrzypczak, Michał (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2016.
Edición:1st ed. 2016.
Colección:Theoretical Computer Science and General Issues, 9802
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-662-52947-8
003 DE-He213
005 20230222042428.0
007 cr nn 008mamaa
008 160805s2016 gw | s |||| 0|eng d
020 |a 9783662529478  |9 978-3-662-52947-8 
024 7 |a 10.1007/978-3-662-52947-8  |2 doi 
050 4 |a QA267-268.5 
072 7 |a UYA  |2 bicssc 
072 7 |a MAT018000  |2 bisacsh 
072 7 |a UYA  |2 thema 
082 0 4 |a 005.131  |2 23 
100 1 |a Skrzypczak, Michał.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Descriptive Set Theoretic Methods in Automata Theory  |h [electronic resource] :  |b Decidability and Topological Complexity /  |c by Michał Skrzypczak. 
250 |a 1st ed. 2016. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2016. 
300 |a XIII, 211 p. 18 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 9802 
505 0 |a Subclasses of regular languages -- Thin algebras -- Extensions of regular languages. 
520 |a 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. 
650 0 |a Machine theory. 
650 0 |a Computer science. 
650 0 |a Algorithms. 
650 0 |a Computer science-Mathematics. 
650 0 |a Discrete mathematics. 
650 0 |a Software engineering. 
650 1 4 |a Formal Languages and Automata Theory. 
650 2 4 |a Computer Science Logic and Foundations of Programming. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Algorithms. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Software Engineering. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783662529461 
776 0 8 |i Printed edition:  |z 9783662529485 
830 0 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 9802 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-662-52947-8  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)