ON HYBRID GROUP CELLULAR AUTOMATA

Abstract. We investigate some conditions for hybrid cellular automatato be group cellular automata. 1. IntroductionCellular automata have been demonstrated by many researchers to be agood computational model for physical systems simulation since the concept ofcellular automata rst introduced by John Von Neumann in the 1950’s. Andresearchers have studied on cellular automata con gured with rules 51, 60, 102,153, 195 or 204 and whether such cellular automata are group cellular automata[1-6].In this note, we will investigate some conditions for such cellular automatato be group cellular automata.2. PreliminariesA cellular automaton (CA) is an array of sites (cells) where each site is inany one of the permissible states. At each discrete time step (clock cycle) theevolution of a site value depends on some rule (the combinational logic) whichis a function of the present state of its k neighbors for a k-neighborhood CA.For 2-state 3-neighborhood CA, the evolution of the i th cell can be representedas a function of the present states of (i 1)