A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Simulations between cellular automata on cayley graphs
[chapter]
1995
Lecture Notes in Computer Science
We consider cellular automata on Cayley graphs and compare their computational powers according to the architecture on which t h e y work. We show that, if there exists a homomorphism with a nite kernel from a group into another one such that the image of the rst group has a nite index in the second one, then every cellular automaton on the Cayley graph of one of these groups can be uniformally simulated by a cellular automaton on the Cayley graph of the other one. This simulation can be
doi:10.1007/3-540-59175-3_112
fatcat:m6i4ytk5hjfuvbkjkobjf5ytre