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.

by publish in Journal of Cellular Automata

Cited by in corpus (6)

• A Survey of Cellular Automata: Types, Dynamics, Non-uniformity and Applications
• How to make dull cellular automata complex by adding memory: Rule 126 case study
• Computation and Universality: Class IV versus Class III Cellular Automata
• Complex dynamics emerging in Rule 30 with majority memory
• Simple networks on complex cellular automata: From de Bruijn diagrams to jump-graphs
• On complex dynamics from reversible cellular automata