Structural organization of a boolean cellular automata

This paper is dealing with the notion of structural organization of Boolean cellular automata as an evolutive concept driving the cellular state space groupping as nearly as possible of the desired final distribution . In this respect there is assumed the introduction of a set of specific categories as the union of structural state combinations. The transition rule will be applied to each neighborhood iff the structural organizational degree , estimated as the chance of evolution toward the desired category , overtakes an empirical threshold . The convergence of the cellular automata organizational process wifi be discussed by studying the Lyapunov function of the synchronous iteration trajectory which drives to the stable configuration . This functional is based on the informational entropy conveyed by each neighborhood, as a performance criterion. There will be evaluated the category weights , i. e. the strengths of the encouragement character of certain categories during the evolutionary process . Some possible applications in the field of image processing will be finally listed.