Global Properties of Cellular Automata

Author(s):  
Bruno Durand
2006 ◽  
Vol 16 (06) ◽  
pp. 1071-1085
Author(s):  
SILVIO CAPOBIANCO

Cellular automata are transformations of configuration spaces over finitely generated groups, such that the next state in a point only depends on the current state of a finite neighborhood of the point itself. Many questions arise about retrieving global properties from such local descriptions, and finding algorithms to perform these tasks. We consider the case when the group is a semi-direct product of two finitely generated groups, and show that a finite factor (whatever it is) can be thought of as part of the alphabet instead of the group, preserving both the dynamics and some "finiteness" properties. We also show that, under reasonable hypotheses, this reduction is computable: this leads to some reduction theorems related to the invertibility problem.


1986 ◽  
Vol 43 (1-2) ◽  
pp. 219-242 ◽  
Author(s):  
Erica Jen

2001 ◽  
Vol 11 (PR3) ◽  
pp. Pr3-205-Pr3-212
Author(s):  
G. Ch. Sirakoulis ◽  
I. Karafyllidis ◽  
A. Thanailakis
Keyword(s):  

1998 ◽  
Vol 4 (4) ◽  
pp. 49-54
Author(s):  
V.А. Val'kovskii ◽  
◽  
D.D. Zerbino ◽  
Keyword(s):  

2014 ◽  
Vol 2014 (1) ◽  
pp. 37-44 ◽  
Author(s):  
Arighna Sarkar ◽  
◽  
Debarka Mukhopadhyay ◽  

Sign in / Sign up

Export Citation Format

Share Document