Determining a regular language by glider-based structures called phases fi_1 in Rule 110
Cellular Automata and Lattice Gases
2007-06-25 v1
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.
Cite
@article{arxiv.0706.3348,
title = {Determining a regular language by glider-based structures called phases fi_1 in Rule 110},
author = {Genaro Juarez Martinez and Harold V. McIntosh and Juan C. Seck Tuoh Mora and Sergio V. Chapa Vergara},
journal= {arXiv preprint arXiv:0706.3348},
year = {2007}
}