Welcome
user_choices_background_image
Welcome
login container bottom
Search Libraries Catalogue
Duplicate Items
Add to My List

Print
Sorts and Limits


Title: Cellular Automata and Discrete Complex Systems 20th International Workshop, AUTOMATA 2014, Himeji, Japan, July 7-9, 2014, Revised Selected Papers / edited by Teijiro Isokawa, Katsunobu Imai, Nobuyuki Matsui, Ferdinand Peper, Hiroshi Umeo.
Lecture Notes in Computer Science,
Lecture notes in computer science,

Author: Isokawa, Teijiro. editor.
Imai, Katsunobu. editor.
Matsui, Nobuyuki. editor.
Peper, Ferdinand. editor.
Umeo, Hiroshi. editor.
SpringerLink (Online service)

General Notes: 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 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.

Publisher: Springer International Publishing : Imprint: Springer,
Publication Place: Cham :
ISBN: 9783319188126
Subject: Computer science.
Computers.
Computer science.
Computation by Abstract Devices.

Series: Lecture Notes in Computer Science, 8996
Lecture notes in computer science, 8996

Contents: 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.
Physical Description: XVI, 149 p. 53 illus. online resource.
Electronic Location: http://dx.doi.org/10.1007/978-3-319-18812-6
Publication Date: 2015.

Results 1 - 1 of 1
  Agency: Collection: Item Type: Status: Barcode: Media Type:
JUST Main Library Electronic Resources No Circulation Available Online -711157 Book