A simulation of cellular automata on hexagons by cellular automata on rings (2001), MartinBruno | AcademicGPT, tlooto

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 topolo (2001), Theoretical Computer Science, MartinBruno | AcademicGPT, tlooto for Academic and Research