Cellular Automata and Discrete Complex Systems: 19th International Workshop, AUTOMATA 2013, Gießen, Germany, September 17-19, 2013. Proceedings

✍ Scribed by Pedro P. B. de Oliveira (auth.), Jarkko Kari, Martin Kutrib, Andreas Malcher (eds.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 2013
• Tongue: English
• Leaves: 196
• Series: Lecture Notes in Computer Science 8155
• Edition: 1
• Category: Library

✦ Synopsis

The volume LNCS 8155 constitutes the refereed proceedings of the 19th International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2013, held in Giessen, Germany, in September 2013. The 8 papers presented were carefully reviewed and selected from 26 submissions. The scope of the workshop spans the following areas the theoretical and practical aspects of a permanent, international, multidisciplinary forum for the collaboration of researchers in the field of Cellular Automata (CA) and Discrete Complex Systems (DCS), to provide a platform for presenting and discussing new ideas and results, to support the development of theory and applications of CA and DCS (e.g. parallel computing, physics, biology, social sciences, and others) as long as fundamental aspects and their relations are concerned, to identify and study within an inter- and multidisciplinary context, the important fundamental aspects, concepts, notions and problems concerning CA and DCS.

✦ Table of Contents

Front Matter....Pages -
Conceptual Connections around Density Determination in Cellular Automata....Pages 1-14
A Guided Tour of Asynchronous Cellular Automata....Pages 15-30
A Note on the Classification of the Most Simple Asynchronous Cellular Automata....Pages 31-45
A Survey on m -Asynchronous Cellular Automata....Pages 46-66
Elementary Cellular Automata with Memory of Delay Type....Pages 67-83
A Robustness Approach to Study Metastable Behaviours in a Lattice-Gas Model of Swarming....Pages 84-97
Leakage Squeezing Using Cellular Automata....Pages 98-109
1-Resiliency of Bipermutive Cellular Automata Rules....Pages 110-123
On the Convergence of Boolean Automata Networks without Negative Cycles....Pages 124-138
Color Blind Cellular Automata....Pages 139-154
Commutators of Bipermutive and Affine Cellular Automata....Pages 155-170
On Polynomial Rings in Information Dynamics of Linear CA....Pages 171-186
Back Matter....Pages -

✦ Subjects

Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Simulation and Modeling; Computer Communication Networks; Data Structures, Cryptology and Information Theory; Computer Science, general