Tom Meyerovitch

Suggest Changes
Learn More
Let X = S G where G is a countable group and S is a finite set. A cellular automaton (CA) is an endomorphism T : X → X (continuous, commuting with the action of G). Shereshevsky [13] proved that for(More)