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

Authors:
Bruno Martin
Affiliations:
Univ. de Nice-Sophia-Antipolis, Sophia-Antipolis, France
Venue:
Theoretical Computer Science
Year:
2001

Citing 5
Cited 0

A linear speed-up theorem for cellular automata

Theoretical Computer Science - Special issue on logic and applications to computer science
Garden of Eden configurations for cellular automata on Cayley graphs of groups

SIAM Journal on Discrete Mathematics
A universal cellular automaton in quasi-linear time and its S—m—n form

Theoretical Computer Science
Models of massive parallelism: analysis of cellular automata and neural networks

Models of massive parallelism: analysis of cellular automata and neural networks
One-way Cellular Automata on Cayley Graphs

FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory

Quantified Score

Hi-index	5.24

Visualization

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 cellular automata over a ring.