10922
EXPLORE
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
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
THINGS TO TRY
Slider Zoom
SNAPSHOTS
RELATED LINKS
Cellular Automaton
(
Wolfram
MathWorld
)
PERMANENT CITATION
"
Automata Generative Networks 1
" from
the Wolfram Demonstrations Project
http://demonstrations.wolfram.com/AutomataGenerativeNetworks1/
Contributed by:
Kovas Boguta
Share:
Embed Interactive Demonstration
New!
Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site.
More details »
Download Demonstration as CDF »
Download Author Code »
(preview »)
Files require
Wolfram
CDF Player
or
Mathematica
.
Related Demonstrations
More by Author
Cellular Automata on Trivalent Networks
Seth J. Chandler
Four-Color Outer Median Cellular Automata on Graphs
Abigail Nussey
Automata Generative Networks 2
Kovas Boguta
Elementary Cellular Automaton with Network
Francis A. Bitonti
Neighbor-Dependent Substitution System
M. A. H. Cloos
Path Rewriting Cellular Automata
Jesse Nochella
Complex Networks from Simple Rewrite Rules
Richard Southwell
Variations on State Transition Diagrams of Elementary Cellular Automata
Daniel de Souza Carvalho
Order, Chaos, and the Formation of a Cantor Set Attractor in Elementary Cellular Automata
Vitaliy Kaurov
Planar Three-Connected Trivalent Network Mobile Automaton
Tommaso Bolognesi
Related Topics
Art
Cellular Automata
Graph Theory
NKS / Wolfram Science
Networks
Browse all topics
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+