default search action
Automata 2020: Stockholm, Sweden
- Hector Zenil:
Cellular Automata and Discrete Complex Systems - 26th IFIP WG 1.5 International Workshop, AUTOMATA 2020, Stockholm, Sweden, August 10-12, 2020, Proceedings. Lecture Notes in Computer Science 12286, Springer 2020, ISBN 978-3-030-61587-1 - Tien Thao Nguyen, Luidnel Maignan:
Exploring Millions of 6-State FSSP Solutions: The Formal Notion of Local CA Simulation. 1-13 - Pedro Paulo Balbi de Oliveira, Enrico Formenti, Kévin Perrot, Sara Riva, Eurico L. P. Ruivo:
Non-maximal Sensitivity to Synchronism in Periodic Elementary Cellular Automata: Exact Asymptotic Measures. 14-28 - Sukanya Mukherjee, Kamalika Bhattacharjee, Sukanta Das:
Cycle Based Clustering Using Reversible Cellular Automata. 29-42 - Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier:
Commutative Automata Networks. 43-58 - Martin Kutrib, Andreas Malcher:
Cellular String Generators. 59-70 - Toni Hotanen:
Everywhere Zero Pointwise Lyapunov Exponents for Sensitive Cellular Automata. 71-85 - Taiga Hongu, Masami Hagiya:
Self-stabilizing Distributed Algorithms by Gellular Automata. 86-98 - Silvio Capobianco, Pierre Guillon, Camille Noûs:
A Characterization of Amenable Groups by Besicovitch Pseudodistances. 99-110 - Ville Salo:
Four Heads are Better than Three. 111-125 - Ilkka Törmä:
Complexity of Generic Limit Sets of Cellular Automata. 126-138 - Maximilien Gadouleau, Luca Mariot:
Latin Hypercubes and Cellular Automata. 139-151
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.