Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata

DOI10.1007/978-3-319-99813-8_37zbMath1515.68192MaRDI QIDQ6163609

Eric Goles Chacc, Diego Maldonado, Nicolas Ollinger, Unnamed Author

Publication date: 30 June 2023

Published in: Developments in Language Theory (Search for Journal in Brave)

zbMATH Keywords

triangular gridasynchronous cellular automatapercolation approachactive neighborsinactive cells

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Related Items (2)

Cold dynamics in cellular automata: a tutorial ⋮ On the impact of treewidth in the computational complexity of freezing dynamics

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of the bootstraping percolation and other problems
• Statistical mechanics of cellular automata
• Parallel Algorithms in Graph Theory: Planarity Testing
• A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton

This page was built for publication: Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata