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

dc.creatorSeck Tuoh Mora, Juan Carlos
dc.date.accessioned2014-06-24T21:29:27Z
dc.date.accessioned2023-07-19T14:08:53Z
dc.date.available2014-06-24T21:29:27Z
dc.date.available2023-07-19T14:08:53Z
dc.date.created2014-06-24T21:29:27Z
dc.date.issued2007
dc.identifierMartínez, Genaro, McIntosh,Harold, Seck Tuoh, Juan C., Chapa, Sergio
dc.identifierhttp://repository.uaeh.edu.mx/bitstream/handle/123456789/15255
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/7706406
dc.description.abstractAs 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.
dc.subjectAutomatización y Optimización de Sistemas Industriales Autómatas Celulares
dc.titleA note about the regular languaje of Rule 110 and its general machine: the scalar subset diagram.
dc.typeArticle


Este ítem pertenece a la siguiente institución