東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Descriptive set theoretic methods in...

Skrzypczak, Michal.

Linked to FindBook

Google Book

Amazon

博客來

Descriptive set theoretic methods in automata theory = decidability and topological complexity /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Descriptive set theoretic methods in automata theory/ by Michal Skrzypczak.
Reminder of title:	decidability and topological complexity /
Author:	Skrzypczak, Michal.
Published:	Berlin, Heidelberg :Springer Berlin Heidelberg : : 2016.,
Description:	xiii, 211 p. :ill., digital ;24 cm.
[NT 15003449]:	Subclasses of regular languages -- Thin algebras -- Extensions of regular languages.
Contained By:	Springer eBooks
Subject:	Descriptive set theory. -
Online resource:	http://dx.doi.org/10.1007/978-3-662-52947-8
ISBN:	9783662529478

Descriptive set theoretic methods in automata theory = decidability and topological complexity /
Skrzypczak, Michal.

Descriptive set theoretic methods in automata theorydecidability and topological complexity /[electronic resource] :by Michal Skrzypczak. - Berlin, Heidelberg :Springer Berlin Heidelberg :2016. - xiii, 211 p. :ill., digital ;24 cm. - Lecture notes in computer science,98020302-9743 ;. - Lecture notes in computer science ;5353..

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

ISBN: 9783662529478

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

739523
Descriptive set theory.

LC Class. No.: QA248

Dewey Class. No.: 511.322

Descriptive set theoretic methods in automata theory = decidability and topological complexity /
LDR:01153nmm a2200325 a 4500 001 2047819
003 DE-He213
005 20160805042447.0
006 m d
007 cr nn 008maaau
008 170319s2016 gw s 0 eng d
020 $a 9783662529478 $q (electronic bk.)
020 $a 9783662529461 $q (paper)
024 7 $a 10.1007/978-3-662-52947-8 $2 doi
035 $a 978-3-662-52947-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA248
072 7 $a UYA $2 bicssc
072 7 $a MAT018000 $2 bisacsh
072 7 $a COM051010 $2 bisacsh
082 0 4 $a 511.322 $2 23
090 $a QA248 $b .S629 2016
100 1 $a Skrzypczak, Michal. $3 2209978
245 1 0 $a Descriptive set theoretic methods in automata theory $h [electronic resource] : $b decidability and topological complexity / $c by Michal Skrzypczak.
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2016.
300 $a xiii, 211 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 9802
505 0 $a Subclasses of regular languages -- Thin algebras -- Extensions of regular languages.
650 0 $a Descriptive set theory. $3 739523
650 0 $a Machine theory. $3 523249
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Mathematical Logic and Formal Languages. $3 892517
650 2 4 $a Logics and Meanings of Programs. $3 892495
650 2 4 $a Computation by Abstract Devices. $3 891207
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Software Engineering. $3 890874
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 5353. $x 0302-9743 $3 1274248
856 4 0 $u http://dx.doi.org/10.1007/978-3-662-52947-8
950 $a Computer Science (Springer-11645)