16 citations · 46 across the 31 of their papers we have counts for
Showing 2013 · cs.DMShow all
2 papers · 2 filters
cs.DM2013
-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…
cs.DM2013
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…