Behaviour of linear cellular automata
LE3 .A278 2005
2005
Mendivil, Franklin
Acadia University
Bachelor of Science
Honours
Mathematics
Mathematics & Statistics
Cellular Automata are simple mathematical/computational models that have many applications. Essentially they are models for individuals interacting in very simple ways with their environment. The class of linear cellular automata is a particularly nice class since one can use the tools of linear algebra to study the long-term behaviour of these automata. This project is a brief overview of the topic of cellular automata, with particular attention paid to the class of linear CA and algebraic methods of characterizing Wolfram’s Rule 90 using the minimal annihilating polynomial. Some previous results for Wolfram’s Rule 90 are expanded to apply to the case where the update rule is acting on a ring instead of a field.
The author retains copyright in this thesis. Any substantial copying or any other actions that exceed fair dealing or other exceptions in the Copyright Act require the permission of the author.
https://scholar.acadiau.ca/islandora/object/theses:458