Self-Reproduction Model for Communication-Restricted Cellular Automata

Many researchers have constructed a self-reproduction model on cellular automata so far. C. G. Langton constructed a simple model on 2-D cellular automata, and it is a dynamic-loop . We consider an embedding of Langton´s model on 1-bit communication cellular automata. The 1-bit communication cellular automaton is a 2-D cellular automaton where communication-capacity is restricted to 1-bit at one-step. The Langton´s model has 8 internal states and generally it is impossible to transfer 8-bit by 1-bit communication without any less of time overhead. In this paper, we present two models for the self-reproduction. The first model reproduces a self-reproduction model that behaves likes Langton-loop on the 2-D communication-restricted cellular automata. However the embedding model has a large number of internal states. The second model, by removing some properties from Langton´s model, we reduced internal states.