However, essential differences exist between self-formation and cellular automata.
No doubt we are able to choose any initial topological system and matrix of interactions for experimental reasons, as is done in cellular automata.
Other approaches, such as cellular automata of social influence, tend to conflate physical and social location into a notion of 2-dimensional neighborhoods.
Synchronous circuits may be defined as automata whose transitions between successive states are triggered by pulses delivered by a global clock.
We also performed several experiments of indexation of natural language texts using transducers or automata.
The differences between the specific automata would then be placed in classes to be used as template arguments.
Our construction can be modified by adding final states to recover the classical minimal realisation theory for finite automata.
One natural implementation of this language of automata is to create a vector or other random-access data structure to represent the states.
