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…