Cellular automata and bootstrap percolation
From MaRDI portal
Publication:2672642
DOI10.1016/j.tcs.2022.04.015MaRDI QIDQ2672642
Jarkko Peltomäki, Guillaume Theyssier, Ilkka Törmä
Publication date: 13 June 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.00656
68Qxx: Theory of computing
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\mu\)-limit sets of cellular automata from a computational complexity perspective
- First passage times for threshold growth dynamics on \(\mathbb{Z}^ 2\)
- Oriented percolation in two dimensions
- Domination by product measures
- Universality in freezing cellular automata
- On the computational complexity of the freezing non-strict majority automata
- Bootstrap percolation, and other automata
- Undecidability and nonperiodicity for tilings of the plane
- Subcritical $\mathcal {U}$-bootstrap percolation models have non-trivial phase transitions
- Percolation
- Characterization of sets of limit measures of a cellular automaton iterated on a random configuration
- Monotone cellular automata
- Probability Inequalities for Sums of Bounded Random Variables
- Monotone Cellular Automata in a Random Environment
- Endomorphisms and automorphisms of the shift dynamical system
- Limit sets of cellular automata associated to probability measures
