3 papers
cs.DM2025
Solving decision problems by distributed consensus with one-dimensional, binary, radius- cellular automata over cyclic configurations
Eurico Ruivo, Pedro Paulo Balbi, Kévin Perrot +2
Probing the ability of automata networks to solve decision problems has received a continuous attention in the literature, and specially with the automata reaching the answer by di…
cs.CC2025
Complexity of the Freezing Majority Rule with L-shaped Neighborhoods
Pablo Concha-Vega, Eric Goles, Pedro Montealegre +1
In this article we investigate the computational complexity of predicting two dimensional freezing majority cellular automata with states , where the local interactions…
cs.CC2025
Timed Prediction Problem for Sandpile Models
Pablo Concha-Vega, Kévin Perrot
We investigate the computational complexity of the timed prediction problem in two-dimensional sandpile models. This question refines the classical prediction problem, which asks w…