Determining a regular language by glider-based structures called phases fi_1 in Rule 110
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- June 2007
- DOI:
- 10.48550/arXiv.0706.3348
- arXiv:
- arXiv:0706.3348
- Bibcode:
- 2007arXiv0706.3348J
- Keywords:
-
- Nonlinear Sciences - Cellular Automata and Lattice Gases
- E-Print:
- by publish in Journal of Cellular Automata