The impact of the rule structure on the algorithm of an cellular automata implementation

In case of the 2-D cellular automata the whole rule f can be considered the set of sub-functions grouped due to the number of "ones" in the neighbourhood. Such decomposition enables indication of sub-functions, which are more important for the global dynamics of file automaton then others. The cellular automata can be implemented in Cellular Neural Network (CMI). The simplest way of such implementation on the CNN Universal Machine was proposed by Cronuse and Chua. We present the modification of this method thanks to which the information about sub-functions can be saved. Due to that we are able to simplify the architecture of a CNN-UM implementing CA. Furthermore the shortage of rite rime of a new stale evaluation is possible. The advantage of the modified CA implementation is possibility to receive the new automaton by manipulation of this part of the structure, which is connected with the sub-fraction.