Abstract
A procedure is given which determines all finite sequences without pre-images for any one dimensional cellular automata with entries in Z 2. On this basis we determine some properties of such sequences, and classify all three site rules. Categories defined by this classification are compared to other phenomenological classifications introduced by Wolfram, Gutowitz, and Jen.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call