The dynamic behavior of nonlinear cellular automata CA-6 with two states (0 and 1) and four different boundary conditions is identified in terms of the fixed point and the recursive formulae generating the state transition graph. The recursive formula...
The dynamic behavior of nonlinear cellular automata CA-6 with two states (0 and 1) and four different boundary conditions is identified in terms of the fixed point and the recursive formulae generating the state transition graph. The recursive formulae explored are, in particular, as following: C(m)=A(m-1) C(m-1) and D(m)=B(m-1) D(m-1).