On Behaviors of Cellular Automata with Rule 14 and 142

In this paper we deal with 1-D finite cellular automata with a triplet local transition rule 14 and 142. And we investigate their behaviors and they are compared with each other. 1 Introduction Cellular automata are discrete dynamical systems, which have discrete time and space, and have a local transition rule. Cellular automata were introduced by J. von Neumann as a simulator of a system having self-reproduction and universal computation. Since cellular automata have wide variety and their behavior are similar to those of complex systems as fractal and chaotic phenomenon for the last two decades many researchers investigated their behaviors and applied in mathematics, physics, biology, computer science and so on[1, 2, 3, 4]. Although Cellular automata have simple structure, their behaviors are very complicated. Behaviors of linear cellular automata were investigated by using algebraic methods[5, 8, 9, 10]. But those of many nonlinear cellular automata except some cellular automata[6..