Elementary cellular automaton Rule 110 explained as a block substitution system
- 59 Downloads
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, that the dynamics of Rule 110 can be reproduced by a set of production rules applied to them. The shape of the blocks in the current configuration can be used for knowing the number of them in the next one; with this, the evolution of random configurations, ether and gliders can be modeled.
KeywordsRule 110 Elementary cellular automata Block substitution system Production rules
Mathematics Subject Classification (2000)68Q80 37B15
Unable to display preview. Download preview PDF.
- 3.Neary T, Woods D (2006) P-completeness of cellular automaton Rule 110. In: International colloquium on automata languages and programming (ICALP). LNCS, vol 4051, pp 132–143Google Scholar
- 4.Richard G (2008) Rule 110: universality and catenations. In: Durand B (ed) Proceedings of the first symposium on cellular automata “Journées Automates Cellulaires”, pp 141–160Google Scholar
- 6.McIntosh H (1999) Rule 110 as it relates to the presence of gliders. http://delta.cs.cinvestav.mx/~mcintosh/comun/RULE110W/RULE110.html. Accessed 15 Aug 2009
- 7.Martínez G, McIntosh H (2001) ATLAS: collisions of gliders like phases of ether in Rule 110. http://delta.cs.cinvestav.mx/~mcintosh/comun/summer2001/bookcollisionsHtml/bookcollisions.html. Accessed 16 Feb 2010