Cantitate/Preț
Produs

Cellular Automata and Discrete Complex Systems: 20th International Workshop, AUTOMATA 2014, Himeji, Japan, July 7-9, 2014, Revised Selected Papers: Lecture Notes in Computer Science, cartea 8996

Editat de Teijiro Isokawa, Katsunobu Imai, Nobuyuki Matsui, Ferdinand Peper, Hiroshi Umeo
en Limba Engleză Paperback – iun 2015
This book constitutes revised selected papers from the 20th International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2014, held in Himeji, Japan, in July 2014.
The 10 regular papers included in this volume were carefully reviewed and selected from a total of 25 submissions. It also contains one invited talk in full paper length.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31958 lei

Preț vechi: 39947 lei
-20% Nou

Puncte Express: 479

Preț estimativ în valută:
6116 6353$ 5080£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319188119
ISBN-10: 3319188119
Pagini: 160
Ilustrații: XV, 149 p. 53 illus.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.25 kg
Ediția:2015
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

Complexity of One-Way Cellular Automata.- Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles.- 5-State Rotation-Symmetric Number-Conserving Cellular Automata are not Strongly Universal.- A Universal Cellular Automaton Without Sensitive Subsystems.- Real-Time Reversible One-Way Cellular Automata.- Cycle Equivalence of Finite Dynamical Systems Containing Symmetries.- Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces.- Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results.- Rapaport Language Recognition by Reversible Partitioned Cellular Automata.- Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2.- Plane-Walking Automata.

Caracteristici

Includes supplementary material: sn.pub/extras