16 citations · 46 across the 31 of their papers we have counts for
4 papers · 1 filter
-Limit Sets of Cellular Automata from a Computational Complexity Perspective
Laurent Boyer, Martin Delacourt, Victor Poupet +2
This paper concerns -limit sets of cellular automata: sets of configurations made of words whose probability to appear does not vanish with time, starting from an initial -ra…
Strict majority bootstrap percolation in the r-wheel
Marcos Kiwi, Pablo Moisset de Espanés, Ivan Rapaport +2
In this paper we study the strict majority bootstrap percolation process on graphs. Vertices may be active or passive. Initially, active vertices are chosen independently with prob…
Stochastic Cellular Automata: Correlations, Decidability and Simulations
Pablo Arrighi, Nicolas Schabanel, Guillaume Theyssier
This paper introduces a simple formalism for dealing with deterministic, non- deterministic and stochastic cellular automata in an unified and composable manner. This formalism all…
Intrinsic universality in tile self-assembly requires cooperation
Pierre-Étienne Meunier, Matthew J. Patitz, Scott M. Summers +3
We prove a negative result on the power of a model of algorithmic self-assembly for which it has been notoriously difficult to find general techniques and results. Specifically, we…