Cellular Automata and Discrete Complex Systems

26th IFIP WG 1.5 International Workshop, AUTOMATA 2020, Stockholm, Sweden, August 10-12, 2020, Proceedings
1. Auflage 2020
ISBN: 978-3-030-61587-1
Verlag: Springer International Publishing

Buch, Englisch, Band 12286, 153 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 289 g

Reihe: Lecture Notes in Computer Science

This volume constitutes the refereed post-conference proceedings of the 26th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2020, held in Stockholm, Sweden, in August 2020. The workshop was held virtually.

The 11 full papers presented in this book were carefully reviewed and selected from a total of 21 submissions. The topics of the conference include dynamical, topological, ergodic and algebraic aspects of CA and DCS, algorithmic and complexity issues, emergent properties, formal languages, symbolic dynamics, tilings, models of parallelism and distributed systems, timing schemes, synchronous versus asynchronous models, phenomenological descriptions, scientific modeling, and practical applications.

Zielgruppe

Research

Autoren/Hrsg.

Zenil, Hector

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten

Inhaltsverzeichnis

Exploring Millions of 6-State FSSP Solutions: the Formal Notion of Local CA Simulation.- Non-maximal sensitivity to synchronism in periodic elementary cellular automata: exact asymptotic measures.- Cycle based Clustering using Reversible Cellular Automata.- Commutative automata networks.- Cellular String Generators.- Everywhere Zero Pointwise Lyapunov Exponents for Sensitive Cellular Automata.- Self-Stabilizing Distributed Algorithms by Gellular Automata.- A characterization of amenable groups with Besicovitch pseudodistances.- Four heads are better than three.- Complexity of Generic Limit Sets of Cellular Automata.- Latin Hypercubes and Cellular Automata.