WOLFRAM|DEMONSTRATIONS PROJECT

Automata Generative Networks 1

A simple parsing algorithm converts each step of a cellular automaton evolution into a tree. Successive trees are linked up by periodically linking nodes that lie in the same column.