Implementation of Combinational Logic Circuits Using Nearest-Neighbor One-Dimensional Four-State Cellular Automata

Cellular automata are simple mathematical idealizations of natural systems. They consist of a lattice of discrete identical sites, each site taking on a nite set of, say, inte- ger values. Over the years, scientists have been trying to investigate the computational capabilities of cellular au- tomata by limiting the dimension, neighborhood radius, and the number of states. In this article, we represent a novel implementation of combinational logic circuits us- ing nearest-neighbor one-dimensional four-state cellular automata (CA). The novelty behind the proposed model is the reduction of the required number of states and yet being able to implement combinational logic-circuits in the conventional CA fashion. This can open a new win- dow to the computation using cellular automata.