Synchronous solution of the parity problem on cyclic configurations, with elementary cellular automaton rule 150, over a family of directed, non-circulant, regular graphs

DOI10.1016/j.ins.2022.10.045MaRDI QIDQ6125207

Fernando Faria, Eurico L. P. Ruivo, Pedro Paulo Balbi

Publication date: 11 April 2024

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

decision problemconsensuselementary cellular automataemergent computationparity problemautomata networks

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Solving the parity problem in one-dimensional cellular automata
• Theory of cellular automata: a survey
• A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update
• Solutions to all-colors problem on graph cellular automata
• Improvement of a Result on Sequencing Elementary Cellular Automata Rules for Solving the Parity Problem
• Merging Cellular Automata Rules to Optimise a Solution to the Modulo-n Problem
• MODULO THREE PROBLEM WITH A CELLULAR AUTOMATON SOLUTION
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Synchronous solution of the parity problem on cyclic configurations, with elementary cellular automaton rule 150, over a family of directed, non-circulant, regular graphs