8758
TOPICS
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
Balanced Annihilation
Elementary cellular automaton rule 184 annihilates balanced initializations with equal numbers of zeros and ones. Mod 2 sums of successive generations highlight how rule 184 parses balanced sequences of opening and closing brackets.
Contributed by:
Michael Schreiber
THINGS TO TRY
Slider Zoom
SNAPSHOTS
RELATED LINKS
Nested Lists
(
NKS|Online
)
PERMANENT CITATION
"
Balanced Annihilation
" from
the Wolfram Demonstrations Project
http://demonstrations.wolfram.com/BalancedAnnihilation/
Contributed by:
Michael Schreiber
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
State Emphasis for 2,3 Turing Machine 596440
Michael Schreiber
Direct Rule Control for 2,3 Turing Machines
Michael Schreiber
Decomposition of 2,3 Turing Machine Evolutions
Michael Schreiber
String Matching Automaton
Michael Schreiber
Coevolving Complements
Michael Schreiber
Direct Rule Control for 3,3 Turing Machines
Michael Schreiber
Direct Rule Control for 3,2 Turing Machines
Michael Schreiber
Balanced Bracket Sequences
Michael Schreiber
Swapping Rule and Initial Condition
Michael Schreiber
Direct Control for Hex Machine
Michael Schreiber
Related Topics
Combinatorics
Computational Universe
Computer Science
Computers
NKS / Wolfram Science
NKS Book
Nested Patterns
Networks
Short Programs
Simple Computational Systems
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+