Algebraic properties of cellular automata

@article{Martin1984AlgebraicPO,
  title={Algebraic properties of cellular automata},
  author={O. Martin and A. Odlyzko and S. Wolfram},
  journal={Communications in Mathematical Physics},
  year={1984},
  volume={93},
  pages={219-258}
}
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… Expand

Figures and Tables from this paper

Global Dynamics of Finite Cellular Automata
Global properties of cellular automata
Universality and complexity in cellular automata
Algebraic Theory of Bounded One-dimensional Cellular Automata
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 32 REFERENCES
Statistical mechanics of cellular automata
On Some Dynamical Properties of Finite Cellular Automaton
String Overlaps, Pattern Matching, and Nontransitive Games
Periodic forest whose largest clearings are of size 3
  • H. ApSimon
  • Mathematics
  • Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences
  • 1970
Periodic forests whose largest clearings are of size n ≥ 4
  • H. ApSimon
  • Mathematics
  • Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
  • 1970
Periodic forests of stunted trees
  • J. P. Miller
  • Mathematics
  • Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences
  • 1970
...
1
2
3
4
...