國立虎尾科技大學 |

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

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Descriptive Set Theoretic Methods in Automata Theory/ by Michał Skrzypczak.
其他題名:	Decidability and Topological Complexity /
作者:	Skrzypczak, Michał.
面頁冊數:	XIII, 211 p. 18 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Mathematical logic. -
電子資源:	https://doi.org/10.1007/978-3-662-52947-8
ISBN:	9783662529478

Descriptive Set Theoretic Methods in Automata Theory = Decidability and Topological Complexity /
Skrzypczak, Michał.

Descriptive Set Theoretic Methods in Automata TheoryDecidability and Topological Complexity /[electronic resource] :by Michał Skrzypczak. - 1st ed. 2016. - XIII, 211 p. 18 illus.online resource. - Theoretical Computer Science and General Issues ;9802. - Theoretical Computer Science and General Issues ;9163.

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.

ISBN: 9783662529478

Standard No.: 10.1007/978-3-662-52947-8doiSubjects--Topical Terms:

810627
Mathematical logic.

LC Class. No.: QA8.9-10.3

Dewey Class. No.: 005.131

Descriptive Set Theoretic Methods in Automata Theory = Decidability and Topological Complexity /
LDR:02337nam a22004095i 4500 001 970908
003 DE-He213
005 20200704052921.0
007 cr nn 008mamaa
008 201211s2016 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
035 $a 978-3-662-52947-8
050 4 $a QA8.9-10.3
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 $3 1266425
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 ; $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 Mathematical logic. $2 bicssc $3 810627
650 0 $a Computer logic. $3 786340
650 0 $a Computers. $3 565115
650 0 $a Algorithms. $3 527865
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Software engineering. $3 562952
650 1 4 $a Mathematical Logic and Formal Languages. $3 670059
650 2 4 $a Logics and Meanings of Programs. $3 670058
650 2 4 $a Computation by Abstract Devices. $3 669792
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Software Engineering. $3 669632
710 2 $a SpringerLink (Online service) $3 593884
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 ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-662-52947-8
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)