Some Results on Exhaustive Input Variations in the Context of Small Sized Cellular Automata

The thesis provides an analysis regarding some results on input variations in the context of small sized quadratic cellular automata.
These results focus on stable patterns but also on instabilities regarding the evolution of these cellular automata.
The methodology used is based on a deterministic and exhaustive calculation and therefore does not involve any simulative or stochastic components.
After a brief introduction of cellular automata and addressing the methodology in an informal language, the latter will be presented formally by means of the actual source code, implemented for this purpose, using the programming language R.