Login / Signup

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

Pedro P. B. de OliveiraEurico L. P. RuivoFernando Faria
Published in: Inf. Sci. (2022)
Keyphrases
  • cellular automaton
  • cellular automata
  • special case
  • least squares
  • graph matching
  • graph theory
  • graph databases
  • reaction diffusion
  • optimal configuration
  • pattern generation