Skip to main content

Research Repository

Advanced Search

A note about the regular language of Rule 110 and its general machine: the scalar subset diagram

Martinez, Genaro J.; McIntosh, Harold V.; Mora, Juan C.S.T; Vergara, Sergio V.C.

Authors

Genaro J. Martinez

Harold V. McIntosh

Juan C.S.T Mora

Sergio V.C. Vergara



Abstract

As it was published in other papers, a regular language can be derived in the elemental cellular automaton (ECA) Rule 110 from a subset of regular expressions produced from its set of gliders. This way, a full description of this subset too is known and reported. This paper will discuss in detail a general machine 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.

Citation

Martinez, G. J., McIntosh, H. V., Mora, J. C., & Vergara, S. V. (2008). A note about the regular language of Rule 110 and its general machine: the scalar subset diagram

Journal Article Type Article
Publication Date Jan 1, 2008
Journal Japan Society for Artificial Intelligence
Peer Reviewed Peer Reviewed
Volume C3004
Pages 39-49
Keywords rule 110, scalar subset diagram
Public URL https://uwe-repository.worktribe.com/output/1020251




Downloadable Citations