A comparison of sequence generation power in cellular automata

Cellular automata (CA) are considered to be a non-linear model of complex systems, computability theory, mathematics and theoretical biology in which an infinite one-dimensional array of finite state machines (cells) updates itself in a synchronous manner according to a uniform local rule. The 1-bit inter-cell communication cellular automaton model (CA_1-bit) is a subclass of CA whose inter-cell communication at one step is restricted to 1-bit. The CA_1-bit can be thought to be one of the most powerless and simplest models in a variety of CAs. In this paper, we study a sequence generation problem on the CA and the CA_1-bit. We make a comparison between CA and CA_1-bit in regarding sequence generation power, and propose a new model of CA_1-bit which operates in symmetrical input/output mode.