Studies On Dynamics Behavior And Evolution Complexity Of Cellular Automata

Cellular automata(CA) are mathematical idealizationa models in which space and time are discrete.Due to the rich dynamical behaviors and parallel information process structure that are suitable to being realized in VLSI,CA have extensive applications in many scientific domains.Symbolic dynamics is an important tool for mathematical analysis.The main contents of this thesis are as follows.The properties of1-D CA with radius one are studied.Then we synthesize the evolution properties of addictive CA by means of the application of algebra and matrix.Based on the ch-aracteristics of additive CA,a new synchronization way of additive CA was presented and rule90synchronization example in the different boundary and length was given.For analysis on application of the additive CA to cipher code,it is showed that the investigation will be of great value in data encryption.The complexity of evolution languages generated from elementary cellular automata of rule184is studied by symbolic dynamics.The stability,the formulae of the number of fixed points and transient length of rule132are studied.Through homoemorphisms we have found1-D CA with radius2are classified.By this mathod,we analysis their properties.We classificated additive rules of1-D CA with radius2,from the point of symbolic dynamics.We also studied the global evolutionary properties and the periodic points of some rules,then we investigate some properties of Isle of Eden possessed by some rules.All these work make the apply of1-D CA with radius2easy.