Cellular Automata and Discrete Complex Systems : 20th International Workshop, Automata 2014, Himeji, Japan, July 7-9, 2014, Revised Selected Papers
Overview
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.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9783319188119
- ISBN-10: 3319188119
- Publisher: Springer
- Publish Date: June 2015
- Dimensions: 9.21 x 6.14 x 0.36 inches
- Shipping Weight: 0.54 pounds
- Page Count: 149
Related Categories
