4 papers · 1 filter
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…
On the complexity of acyclic modules in automata networks
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
Modules were introduced as an extension of Boolean automata networks. They have inputs which are used in the computation said modules perform, and can be used to wire modules with…
A framework for (de)composing with Boolean automata networks
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
Boolean automata networks (BANs) are a generalisation of Boolean cellular automata. In such, any theorem describing the way BANs compute information is a strong tool that can be ap…