On the Representation of Gliders in Rule 54 by De Bruijn and Cycle Diagrams

Authors:
Genaro J. Martínez;Andrew Adamatzky;Harold V. Mcintosh
Affiliations:
Faculty of Computing, Engineering and Mathematical Sciences, University of the West of England, Bristol, United Kingdom;Faculty of Computing, Engineering and Mathematical Sciences, University of the West of England, Bristol, United Kingdom;Departamento de Aplicación de Microcomputadoras, Instituto de Ciencias, Universidad Autónoma de Puebla, Puebla, México
Venue:
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Year:
2008

Citing 6
Cited 0

Computational mechanics of cellular automata: an example

Proceedings of the workshop on Lattice dynamics
Classifying cellular automata automatically: finding gliders, filtering, and relating space-time patterns, attractor basins, and the Z parameter

Complexity
A new kind of science

A new kind of science
Shift Register Sequences

Shift Register Sequences
Collision-based computing

Collision-based computing
One Dimensional Cellular Automata

One Dimensional Cellular Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rule 54, in Wolfram's notation, is one of elementary yet complexly behaving one-dimensional cellular automata. The automaton supports gliders, glider guns and other non-trivial long transients. We show how to characterize gliders in Rule 54 by diagram representations as de Bruijn and cycle diagrams; offering a way to present each glider in Rule 54 with particular characteristics. This allows a compact encoding of initial conditions which can be used in implementing non-trivial collision-based computing in one-dimensional cellular automata.