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

Martinez, G. J., McIntosh, H. V., Mora, J. C. and Vergara, S. V. (2008) A note about the regular language of Rule 110 and its general machine: the scalar subset diagram. Japan Society for Artificial Intelligence, C3004. pp. 39-49.

Full text not available from this repository

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.

Item Type:Article
Uncontrolled Keywords:rule 110, scalar subset diagram
Faculty/Department:Faculty of Environment and Technology
ID Code:10576
Deposited By: A. Lawson
Deposited On:26 Jul 2010 11:38
Last Modified:12 Aug 2013 08:02

Request a change to this item

Copyright 2013 © UWE better together