A note about the regular languaje of Rule 110 and its general machine: the scalar subset diagram.
Seck Tuoh Mora, Juan Carlos
2007
Martínez, Genaro, McIntosh,Harold, Seck Tuoh, Juan C., Chapa, Sergio
Abstract
As it was published in other papers, a regular languagecan be derived in the elemental cellular automaton (ECA)Rule 110 from a subset of regular expressions produced from itsset of gliders. This way, a full description of this subset too isknown and reported. This paper will discuss in detail a generalmachine able to validate completely the subset of regular expressions in Rule 110 and other characteristics, such as, the calculus of Garden of Eden configurations in Rule 110. Such machine is the subset diagram.
Artículos relacionados
Elementary cellular automaton Rule 110 explained as a block substitution system
Pair Diagram and Cyclic Properties Characterizing the Inverse of Reversible Automata
How to Make Dull Cellular Automata Complex by Adding Memory: Rule 126 Case Study
Unconventional invertible behaviors in reversible one-dimensional cellular automata.
Reproducing the Cyclic Tag System Developed by Matthew Cook with Rule 110 Using the Phases f(i-)1.
Complex Dynamics Emerging in Rule 30 with Majority Memory
Modeling a Nonlinear Liquid Level System by Cellular Neural Networks