Cellular automata preimages: count and list algorithm

Authors:
Iztok Jeras;Andrej Dobnikar
Affiliations:
-;Faculty of Computer and Information Science, University of Ljubljana, Ljubljana, Slovenia
Venue:
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
Year:
2006

Citing 2
Cited 0

Predecessors of cellular automata states, II.: pre-images of finite sequences

Physica D
Classifying cellular automata automatically: finding gliders, filtering, and relating space-time patterns, attractor basins, and the Z parameter

Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

Preimages of cellular automata are observed. Their number is computed using simple matrix operations. Three algorithms for making a list of preimages are graphically presented using the de Bruijn diagram and its concatenated form: the preimage network.