Cellular Automata and Discrete Complex Systems
Editat de Teijiro Isokawa, Katsunobu Imai, Nobuyuki Matsui, Ferdinand Peper, Hiroshi Umeoen Limba Engleză Paperback – iun 2015
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.
Preț: 314.43 lei
Preț vechi: 393.04 lei
-20% Nou
Puncte Express: 472
Preț estimativ în valută:
55.64€ • 64.89$ • 48.85£
55.64€ • 64.89$ • 48.85£
Carte tipărită la comandă
Livrare economică 15-29 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319188119
ISBN-10: 3319188119
Pagini: 168
Ilustrații: XV, 149 p. 53 illus.
Dimensiuni: 155 x 235 x 10 mm
Greutate: 0.27 kg
Ediția:2015
Editura: Springer
Locul publicării:Cham, Switzerland
ISBN-10: 3319188119
Pagini: 168
Ilustrații: XV, 149 p. 53 illus.
Dimensiuni: 155 x 235 x 10 mm
Greutate: 0.27 kg
Ediția:2015
Editura: Springer
Locul publicării:Cham, Switzerland
Public țintă
ResearchCuprins
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