A note on cellular automata simulations

During the past several years, a number of papers have appeared on the subject of simulation in cellular automata systems. This paper describes a simulation of a two-dimensional system using a square neighborhood of n × n cells by one, using the generalized von Neumann neighborhood, which costs significantly less in terms of cell complexity than existing simulations. In addition, the equivalences between certain neighborhoods are demonstrated