Wolfram Research

Mathematica MathWorld Wolfram Science More »

HOME

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.

Contributed by: Kovas Boguta

Show Initialization Code

(91 lines omitted)

Cellular Automaton (Wolfram MathWorld)

"Automata Generative Networks 1" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/AutomataGenerativeNetworks1/

Contributed by: Kovas Boguta

Report an issue »

Interact with Demonstrations using the latest version of the free Mathematica Player—Download Now

Browse all topics

	Source page:
	Email	Name (optional)
	Occupation (optional)	Organization (optional)
	I use Mathematica often occasionally never
	Country (optional) Remember me
	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 »

Wolfram Research

Site Index

RSS

Atom

Note: To run this Demonstration you need the free
Mathematica Player or Mathematica 7+