Generalisation of a synchronous solution of the parity problem on cyclic configurations over a non-circulant graph

Cites Work

Title not available (Why is that?)
Solving the parity problem in one-dimensional cellular automata
Theory of cellular automata: a survey
An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata
A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update
Solutions to all-colors problem on graph cellular automata
On density determination with cellular automata: results, constructions and directions
Improvement of a result on sequencing elementary cellular automata rules for solving the parity problem
Modified traffic cellular automaton for the density classification task
On the Synchronisation Problem over Cellular Automata
Computing Modulo-n by Composing Cellular Automata Rules
MODULO THREE PROBLEM WITH A CELLULAR AUTOMATON SOLUTION
A portfolio of classification problems by one-dimensional cellular automata, over cyclic binary configurations and parallel update
Synchronous solution of the parity problem on cyclic configurations, with elementary cellular automaton rule 150, over a family of directed, non-circulant, regular graphs

This page was built for publication: Generalisation of a synchronous solution of the parity problem on cyclic configurations over a non-circulant graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6539381)