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

dc.contributor.author	Seck Tuoh Mora, Juan Carlos	es
dc.date.accessioned	2014-06-24T21:29:27Z
dc.date.available	2014-06-24T21:29:27Z
dc.date.issued	2007	es
dc.description.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.	es
dc.identifier.citation	Martínez, Genaro, McIntosh,Harold, Seck Tuoh, Juan C., Chapa, Sergio	es
dc.identifier.uri	https://repository.uaeh.edu.mx/bitstream/handle/123456789/15255
dc.language	es	es
dc.subject	Automatización y Optimización de Sistemas Industriales Autómatas Celulares	es
dc.title	A note about the regular languaje of Rule 110 and its general machine: the scalar subset diagram.	es
dc.type	Article	es

Archivos

Mostrando 1 - 1 de 1