On the collision-propagation and gather-update formulations of a cellular automata rule

Authors
  • A. Caiazzo
Publication date 2008
Host editors
  • H. Umeo
  • S. Morishita
  • K. Nishinari
  • T. Komatsuzaki
  • S. Bandini
Book title Cellular Automata
Book subtitle 8th International Conference on Cellular Aotomata for Reseach and Industry, ACRI 2008, Yokohama, Japan, September 23-26, 2008 : proceedings
ISBN
  • 9783540799917
ISBN (electronic)
  • 9783540799924
Series Lecture Notes in Computer Science
Event 8th International Conference on Cellular Automata for Reseach and Industry (ACRI 2008), Yokohama, Japan
Pages (from-to) 144-151
Publisher Berlin: Springer
Organisations
  • Faculty of Science (FNWI) - Informatics Institute (IVI)
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.
Document type Conference contribution
Language English
Published at https://doi.org/10.1007/978-3-540-79992-4_19
Permalink to this page
Back