MartinBruno
2001.7.28Theoretical Computer Science
tlooto Summary
It is proved that cellular automata de)ned over a hexagonal grid can be simulated by using Cayley graphs, and it is shown that these automata have similar computational power according to their topology.
Abstract
We consider cellular automata on Cayley graphs and compare their computational power according to their topology. We prove that cellular automata de)ned over a hexagonal grid can be simulated by ce...
Citation format
MARTINBRUNO. A simulation of cellular automata on hexagons by cellular automata on rings. Theoretical Computer Science, 2001.