Programme Notes:
Nomads are people who move around depending on the dictates of their living conditions.
Finite State Automata are machines that have a finite number of possible states.
Perhaps one of the simplest machines is one that changes the colour it finds as it moves in a finite
number of different directions, according to the dictates of the colours in
its environemnt.
The
number of states is then determined by the number of directions in
which it can move.
The transformation rules determine how and when any state will change.
The menu allows slightly different rules to be applied to individual machines.
The result is anarchic "chaos" -but chaos can be both fascinating and
boring... depending on the rules which determine its inner structure.
---------------------------------------------------------
To start Java Applet -click on image
(To bring up process menu: right click on Java image when Applet is running)
Use left mouse button to control Interface buttons
Use browser navigation buttons to close or leave the process window
---------------------------------------------------------
The Works
FSAMads-001BS
Basic System
FSAMads-002SMT
Self-Modifying Transformation rules
FSAMads-003SMTSMS
Self-Modifying Transformation rules & Self-Modifying Scale
FSAMads-004SMTSC
Self-Modifying Transformation rules, Scale and Colour
FSAMads-005CSI
Interacting Self-Modifying rules
FSAMads-006V
Variable Component System
FSAMads-007VLoop
Variable Loops and Components