Show simple item record

dc.contributor.authorSeck Tuoh Mora, Juan Carloses
dc.date.accessioned2014-06-24T21:29:27Z
dc.date.available2014-06-24T21:29:27Z
dc.date.issued2007es
dc.identifier.citationMartínez, Genaro, McIntosh,Harold, Seck Tuoh, Juan C., Chapa, Sergioes
dc.identifier.urihttps://repository.uaeh.edu.mx/bitstream/handle/123456789/15255
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.es
dc.languageeses
dc.subjectAutomatización y Optimización de Sistemas Industriales Autómatas Celulareses
dc.titleA note about the regular languaje of Rule 110 and its general machine: the scalar subset diagram.es
dc.typeArticlees


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record