6. Conclusions and discussion
In this paper, the analytic function Ntþ1
x ¼ f ðst
x; g1; g2Þ of the local rules in Elementary Cellular Automata is established by
constructing the recognition function of the states of the cells and the neighbors. Based on the proposed method, the analytic
function of the local rules in other 2-state cellular automata is also studied and constructed. The simulation results show that
the programming structure is optimized and the programming efficiency is enhanced by the proposed method.