# Cellular Automata with Global Control

Cellular Automata with Global Control

This Demonstration implements an idea of Stephen Wolfram and others of a cellular automaton that chooses the rule to apply based on the global state of the automaton. The cellular automaton is thus temporally inhomogeneous. Here, you can specify two possible elementary cellular automaton rules and four functions that choose which of the rules to apply on any given iteration. You can make two other types of choices. You can choose the initial state of the cellular automaton from amongst a seed configuration, a random configuration or a de Bruijn Sequence specification. The Demonstration outputs the results of the two elementary cellular automata and the result of the composition using the particular global control function. The elementary rule used is appended to the right of the latter plot and appears as stripes. You can also select a color scheme to optimize aesthetics.