Introduction

Abstract

Cellular automata are regular uniform networks of locally-connected finite-state machines, called cells. A cell takes a finite number of states. Cells are locally connected: every cell updates its state depending on states of its geographically closest neighbours. All cells update their states simultaneously in discrete time steps. All cells employe the same rule to calculate their states. Cellular automata are discrete systems with non-trivial behaviour. They are mathematical models of computation and computer models of natural systems.