Determining a regular language by glider-based structures called phases fi_1 in Rule 110
Genaro Juarez Martinez, Harold V. McIntosh, Juan C. Seck Tuoh Mora, Sergio V. Chapa Vergara
2007.6.22Journal of Cellular Automata
tlooto Summary
A representation for coding initial conditions by means of a finite subset of regular expressions specifying a set of phases fi_1 for each glider in Rule 110 is proposed.
Abstract
Rule 110 is a complex elementary cellular automaton able of supporting universal computation and complicated collision-based reactions between gliders. We propose a representation for coding initial conditions by means of a finite subset of regular expressions. The sequences are extracted both from de Bruijn diagrams and tiles specifying a set of phases fi_1 for each glider in Rule 110. The subset of regular expressions is explained in detail.
Citation format
MARTINEZ, Genaro Juarez, et al. Determining a regular language by glider-based structures called phases fi_1 in rule 110 [preprint]. arXiv, 2007. arXiv:0706.3348.