Determining a regular language by glider-based structures called phases fi_1 in Rule 110

Simple item page
dc.creatorMartinez, Genaro Juarez
dc.creatorMcIntosh, Harold V.
dc.creatorMora, Juan C. Seck Tuoh
dc.creatorVergara, Sergio V. Chapa
dc.date2007-06-22
dc.date.accessioned2026-07-07T08:11:55Z
dc.date.available2026-07-07T08:11:55Z
dc.descriptionRule 110 is a complex elementary cellular automaton able of supporting universal computation and complicated collision-based reactions between gliders. We propose a representation for coding initial conditions by means of a finite subset of regular expressions. The sequences are extracted both from de Bruijn diagrams and tiles specifying a set of phases fi_1 for each glider in Rule 110. The subset of regular expressions is explained in detail.
dc.descriptionby publish in Journal of Cellular Automata
dc.identifierhttps://arxiv.org/abs/0706.3348
dc.identifierhttp://arxiv.org/abs/0706.3348
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/132278
dc.subjectCellular Automata and Lattice Gases
dc.titleDetermining a regular language by glider-based structures called phases fi_1 in Rule 110
dc.typetext

Files

Collections

arXiv