Simulating 3D Cellular Automata with 2D Cellular Automata

  • Victor Poupet
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3153)


The purpose of this article is to describe a way to simulate any 3-dimensional cellular automaton with a 2-dimensional cellular automaton. We will present the problems that arise when changing the dimension, propose solutions and discuss the main properties of the obtained simulation.


Polynomial Time Cellular Automaton Central State Cayley Graph Moore Neighborhood 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Frisch, U., d’Humières, D., Hasslacher, B., Lallemand, P., Pomeau, Y., Rivet, J.P.: Lattice gas hydrodynamics in two and three dimension. Complex Systems 1, 649–707 (1987) Reprinted in Doolen, G. (ed.) Lattice Gas Methods for Partial Differential Equations, p.77, Addison-Wesley (1990)Google Scholar
  2. 2.
    Róka, Z.: Simulations between cellular automata on Cayley graphs. Theoretical Computer Science 225, 81–111 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Martin, B.: A geometrical hierarchy on graphs via cellular automata. Fundamenta Informaticae 52, 157–181 (2002)zbMATHMathSciNetGoogle Scholar
  4. 4.
    Cole, S.N.: Real-time computation by n-dimensional iterative arrays of finite-state machines. IEEE Transactions on Computers C-18, 349–365 (1969)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Victor Poupet
    • 1
  1. 1.LIP (UMR CNRS, ENS Lyon, INRIA, Univ. Claude Bernard Lyon 1), École Normale Supérieure de LyonLYONFRANCE

Personalised recommendations