Determining a regular language by glider-based structures called phases fi_1 in Rule 110
(2008)
Journal Article
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 e... Read More about Determining a regular language by glider-based structures called phases fi_1 in Rule 110.