大葉大學圖書館 |

登入

回首頁

Descriptive set theoretic methods in...

Skrzypczak, Michal.

Descriptive set theoretic methods in automata theory[electronic resource] :decidability and topological complexity /

紀錄類型:	書目-電子資源 : Monograph/item
杜威分類號:	511.322
書名/作者:	Descriptive set theoretic methods in automata theory : decidability and topological complexity // by Michal Skrzypczak.
作者:	Skrzypczak, Michal.
出版者:	Berlin, Heidelberg : : Springer Berlin Heidelberg :, 2016.
面頁冊數:	xiii, 211 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Descriptive set theory.
標題:	Machine theory.
標題:	Computer Science.
標題:	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 Engineering.
ISBN:	9783662529478
ISBN:	9783662529461
內容註:	Subclasses of regular languages -- Thin algebras -- Extensions of regular languages.
電子資源:	http://dx.doi.org/10.1007/978-3-662-52947-8

Descriptive set theoretic methods in automata theory[electronic resource] :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 ;7103..

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

ISBN: 9783662529478

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

669637
Descriptive set theory.

LC Class. No.: QA248

Dewey Class. No.: 511.322

Descriptive set theoretic methods in automata theory[electronic resource] :decidability and topological complexity /
LDR:01153nmm a2200325 a 4500 001 465542
003 DE-He213
005 20160805042447.0
006 m d
007 cr nn 008maaau
008 170411s2016 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 669636
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 669637
650 0 $a Machine theory. $3 173754
650 1 4 $a Computer Science. $3 423143
650 2 4 $a Mathematical Logic and Formal Languages. $3 463478
650 2 4 $a Logics and Meanings of Programs. $3 466905
650 2 4 $a Computation by Abstract Devices. $3 463641
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 463701
650 2 4 $a Discrete Mathematics in Computer Science. $3 464912
650 2 4 $a Software Engineering. $3 464601
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 7103. $3 466200
856 4 0 $u http://dx.doi.org/10.1007/978-3-662-52947-8
950 $a Computer Science (Springer-11645)

筆 0 讀者評論

多媒體

多媒體檔案
http://dx.doi.org/10.1007/978-3-662-52947-8

評論

新增評論分享你的心得

Export

取書館別