Algebraic properties of cellular automata (Q1058294)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3900161
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algebraic properties of cellular automata |
scientific article; zbMATH DE number 3900161 |
Statements
Algebraic properties of cellular automata (English)
0 references
1984
0 references
Cellular automata are discrete dynamical systems, of simple construction but complex and varied behaviour. Algebraic techniques are used to give an extensive analysis of the global properties of a class of finite cellular automata. The complete structure of state transition diagrams is derived in terms of algebraic and number theoretical quantities. The systems are usually irreversible, and are found to evolve through transients to attractors consisting of cycles sometimes containing a large number of configurations.
0 references
global properties
0 references
structure of state transition diagrams
0 references
attractors
0 references
0.8673069477081299
0 references
0.8348783254623413
0 references
0.8313961625099182
0 references
