Elementary cellular automaton Rule 110 explained as a block substitution system

@article{Mora2010ElementaryCA,
  title={Elementary cellular automaton Rule 110 explained as a block substitution system},
  author={Juan Carlos Seck Tuoh Mora and Genaro Ju{\'a}rez Mart{\'i}nez and Norberto Hernandez-Romero and Joselito Medina Mar{\'i}n},
  journal={Computing},
  year={2010},
  volume={88},
  pages={193-205}
}
This paper presents the characterization of Rule 110 as a block substitution system of three symbols. Firstly, it is proved that the dynamics of Rule 110 is equivalent to cover the evolution space with triangles formed by the cells of the automaton. It is hence demonstrated that every finite configuration can be partitioned in several blocks of symbols and… CONTINUE READING