國立虎尾科技大學 |

Exercises in cellular automata and groups

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Exercises in cellular automata and groups/ by Tullio Ceccherini-Silberstein, Michel Coornaert ; foreword by Rostislav I. Grigorchuk.
作者:	Ceccherini-Silberstein, Tullio.
其他作者:	Grigorchuk, Rostislav I.
出版者:	Cham :Springer International Publishing : : 2023.,
面頁冊數:	xvii, 627 p. :ill., digital ; : 24 cm.;
Contained By:	Springer Nature eBook
標題:	Computer Science Logic and Foundations of Programming. -
電子資源:	https://doi.org/10.1007/978-3-031-10391-9
ISBN:	9783031103919

Exercises in cellular automata and groups
Ceccherini-Silberstein, Tullio.

Exercises in cellular automata and groups[electronic resource] /by Tullio Ceccherini-Silberstein, Michel Coornaert ; foreword by Rostislav I. Grigorchuk. - Cham :Springer International Publishing :2023. - xvii, 627 p. :ill., digital ;24 cm. - Springer monographs in mathematics,2196-9922. - Springer monographs in mathematics..

1 Cellular Automata -- 2 Residually Finite Groups -- 3 Surjunctive Groups -- 4 Amenable Groups -- 5 The Garden of Eden Theorem -- 6 Finitely Generated Amenable Groups -- 7 Local Embeddability and Sofic Groups -- 8 Linear Cellular Automata.

This book complements the authors' monograph Cellular Automata and Groups [CAG] (Springer Monographs in Mathematics) It consists of more than 600 fully solved exercises in symbolic dynamics and geometric group theory with connections to geometry and topology, ring and module theory, automata theory and theoretical computer science. Each solution is detailed and entirely self-contained, in the sense that it only requires a standard undergraduate-level background in abstract algebra and general topology, together with results established in [CAG] and in previous exercises. It includes a wealth of gradually worked out examples and counterexamples presented here for the first time in textbook form. Additional comments provide some historical and bibliographical information, including an account of related recent developments and suggestions for further reading. The eight-chapter division from [CAG] is maintained. Each chapter begins with a summary of the main definitions and results contained in the corresponding chapter of [CAG]. The book is suitable either for classroom or individual use.

ISBN: 9783031103919

Standard No.: 10.1007/978-3-031-10391-9doiSubjects--Topical Terms:

1365757
Computer Science Logic and Foundations of Programming.

LC Class. No.: QA267.5.C45

Dewey Class. No.: 511.35

Exercises in cellular automata and groups
LDR:02443nam a2200337 a 4500 001 1117837
003 DE-He213
005 20231101055421.0
006 m d
007 cr nn 008maaau
008 240126s2023 sz s 0 eng d
020 $a 9783031103919 $q (electronic bk.)
020 $a 9783031103902 $q (paper)
024 7 $a 10.1007/978-3-031-10391-9 $2 doi
035 $a 978-3-031-10391-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267.5.C45
072 7 $a PBF $2 bicssc
072 7 $a MAT002000 $2 bisacsh
072 7 $a PBF $2 thema
082 0 4 $a 511.35 $2 23
090 $a QA267.5.C45 $b C387 2023
100 1 $a Ceccherini-Silberstein, Tullio. $e author. $3 1326452
245 1 0 $a Exercises in cellular automata and groups $h [electronic resource] / $c by Tullio Ceccherini-Silberstein, Michel Coornaert ; foreword by Rostislav I. Grigorchuk.
260 $a Cham : $c 2023. $b Springer International Publishing : $b Imprint: Springer,
300 $a xvii, 627 p. : $b ill., digital ; $c 24 cm.
490 1 $a Springer monographs in mathematics, $x 2196-9922
505 0 $a 1 Cellular Automata -- 2 Residually Finite Groups -- 3 Surjunctive Groups -- 4 Amenable Groups -- 5 The Garden of Eden Theorem -- 6 Finitely Generated Amenable Groups -- 7 Local Embeddability and Sofic Groups -- 8 Linear Cellular Automata.
520 $a This book complements the authors' monograph Cellular Automata and Groups [CAG] (Springer Monographs in Mathematics) It consists of more than 600 fully solved exercises in symbolic dynamics and geometric group theory with connections to geometry and topology, ring and module theory, automata theory and theoretical computer science. Each solution is detailed and entirely self-contained, in the sense that it only requires a standard undergraduate-level background in abstract algebra and general topology, together with results established in [CAG] and in previous exercises. It includes a wealth of gradually worked out examples and counterexamples presented here for the first time in textbook form. Additional comments provide some historical and bibliographical information, including an account of related recent developments and suggestions for further reading. The eight-chapter division from [CAG] is maintained. Each chapter begins with a summary of the main definitions and results contained in the corresponding chapter of [CAG]. The book is suitable either for classroom or individual use.
650 2 4 $a Computer Science Logic and Foundations of Programming. $3 1365757
650 2 4 $a Dynamical Systems. $3 1366074
650 1 4 $a Algebra. $2 gtt $3 579870
650 0 $a Cellular automata. $3 574251
700 1 $a Grigorchuk, Rostislav I. $3 1431770
700 1 $a Coornaert, M. $3 1431769
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
830 0 $a Springer monographs in mathematics. $3 882184
856 4 0 $u https://doi.org/10.1007/978-3-031-10391-9
950 $a Mathematics and Statistics (SpringerNature-11649)