3 papers
cs.DM2026
Non-trivial automata networks do exist that solve the global majority problem with the local majority rule
Pedro Paulo Balbi, Kévin Perrot, Marius Rolland +1
The global majority problem, often referred to as the Density Classification Task, is a classical benchmark in the context of probing the computational capabilities of automata net…
cs.CV2025
Analysis of the Robustness of an Edge Detector Based on Cellular Automata Optimized by Particle Swarm
VinÃcius Ferraria, Eurico Ruivo
The edge detection task is essential in image processing aiming to extract relevant information from an image. One recurring problem in this task is the weaknesses found in some de…
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…