A simulation of cellular automata on hexagons by cellular automata on rings

摘要

We consider cellular automata on Cayley graphs and compare their computational power according to their topology. We prove that cellular automata defined over a hexagonal grid can be simulated by cellular automata over a ring. (C) 2001 Elsevier Science BN. All rights reserved. [References: 9]