论文部分内容阅读
Cellular automata are the discrete dynamical systems of simple construction but with complex and varied behaviors.In this paper,the elementary cellular automaton of rule 22 is studied by the tools of formal language theory and symbolic dynamics.Its temporal evolution orbits are coarse grained into evolution sequences and the evolution languages are defined.It is proved that for every n ≥2 its width n evolution language is not regular.
Cellular automata are the discrete dynamical systems of simple construction but with complex and varied behaviors. In this paper, the elementary cellular automaton of rule 22 is studied by the tools of formal language theory and symbolic dynamics. Its temporal evolution orbits are coarse grained into evolution Sequences and the Evolution languages are defined. It is proved that for every n ≥ 2 its width n evolution language is not regular.