Periodicity and Invertibility of Lattice Gas Cellular Automata

A cellular automaton is a type of mathematical system that models the behavior of a set of cells with discrete values in progressing time steps. The often complicated behaviors of cellular automata are studied in computer science, mathematics, biology, and other science related fields. Lattice gas cellular automata are used to simulate the movements of particles. This thesis aims to discuss the properties of lattice gas models, including periodicity and invertibility, and to examine their accuracy in reflecting the physics of particles in real life. Analysis of elementary cellular automata is presented to introduce the concept of cellular automata and construct foundations for the analysis of properties of lattice gas