Definition 2: A Cellular Automaton(CA), A, is an ordered triple(r, N, M) where is a cellular space. N is a fundamental neighborhood, and M is a finite state machine such that the input alphabet of M is
Q and the local transition function(update rule) for each node is of the form QINI+1 Q for CA with memory, and NI Q for memoryless CA