Table of Contents
|
Cellular Automata and Discrete Complex Systems
Hector Zenil |
Front Matter |
Exploring Millions of 6-State FSSP Solutions: the Formal Notion of Local CA Simulation Exploration de millions de solutions FSSP: la notion formelle de simulation locale d'automate cellulaire
Tien Thao Nguyen, Luidnel Maignan |
1-13 |
Non-maximal Sensitivity to Synchronism in Periodic Elementary Cellular Automata: Exact Asymptotic Measures
Pedro Balbi, Enrico Formenti, Kévin Perrot, Sara Riva, Eurico Ruivo |
14-28 |
Cycle Based Clustering Using Reversible Cellular Automata
Sukanya Mukherjee, Kamalika Bhattacharjee, Sukanta Das |
29-42 |
Commutative automata networks
Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier |
43–58 |
Cellular String Generators
Martin Kutrib, Andreas Malcher |
59-70 |
Everywhere Zero Pointwise Lyapunov Exponents for Sensitive Cellular Automata
Toni Hotanen |
71-85 |
Self-stabilizing Distributed Algorithms by Gellular Automata
Taiga Hongu, Masami Hagiya |
86-98 |
A Characterization of Amenable Groups by Besicovitch Pseudodistances
Silvio Capobianco, Pierre Guillon, Camille Noûs |
99-110 |
Four Heads are Better than Three
Ville Salo |
111-125 |
Complexity of Generic Limit Sets of Cellular Automata
Ilkka Törmä |
126-138 |
Latin Hypercubes and Cellular Automata
Maximilien Gadouleau, Luca Mariot |
139-151 |
