On the Collision-Propagation and Gather-Update Formulations of a Cellular Automata Rule

  • Authors:

  • Bastien Chopard;Jean-Luc Falcone;Ranaivo Razakanirina;Alfons Hoekstra;Alfonso Caiazzo

  • Affiliations:

  • University of Geneva, Switzerland;University of Geneva, Switzerland;University of Geneva, Switzerland;University of Amsterdam, The Netherlands;University of Amsterdam, The Netherlands

  • Venue:
  • ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider two formulations of a cellular automata: the first one uses a gather-update paradigm and the second one a collision-propagation paradigm. We show the equivalence of both descriptions and, using the latter paradigm, we propose a simple way to define a Cellular Automata on a graph with arbitrary topology. Finally, we exploit the duality of formulation to reconsider the problem of characterizing invertible cellular automata.