Cellular Automata without Redundant Information

Keeping only the unique rows in a cellular automaton (CA) reduces redundant information. This works best for class 1 and 2 CAs, those that involve only one color and repetitive patterns, respectively. The CA classes 3 and 4 (those that behave randomly and with local random patterns, respectively) cannot be compressed in most cases.
To find redundancy in CA patterns that evolve laterally or with inclination, it is useful to shift or transpose the data.
The process of compressing a CA is not reversible.

comments
 
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed.
Privacy Policy »

Note: To run this Demonstration you need the free
Mathematica Player
or Mathematica 7+
Download or upgrade to Mathematica Player 7
I already have Mathematica Player or Mathematica 7+