6 papers
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…
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…
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…
A sequential solution to the density classification task using an intermediate alphabet
Pacôme Perrotin, Pedro Paulo Balbi, Eurico Ruivo
We present a sequential cellular automaton of radius 2 1 as a solution to the density classification task that makes use of an intermediate alphabet, and converges to a clean fixed…
Fast solutions to k-parity and k-synchronisation using parallel automata networks
Pacôme Perrotin, Eurico Ruivo, Pedro Paulo Balbi
We present a family of automata networks that solve the k-parity problem when run in parallel. These solutions are constructed by connecting cliques in a non-cyclical fashion. The…
Non-maximal sensitivity to synchronism in periodic elementary cellular automata: exact asymptotic measures
Pedro P. B. de Oliveira, Enrico Formenti, Kévin Perrot +2
In [11] and [13] the authors showed that elementary cellular automata rules 0, 3, 8, 12, 15, 28, 32, 34, 44, 51, 60, 128, 136, 140, 160, 162, 170, 200 and 204 (and their conjugatio…