Reversibility in Asynchronous Cellular Automata
Anindita Sarkar
Anindita Mukherjee
Sukanta Das
Department of Information Technology
Bengal Engineering and Science University, Shibpur
Howrah, West Bengal, India 711103
Abstract
The reversibility issue of one-dimensional asynchronous cellular automata (ACAs) is addressed in this paper. The cells of ACAs are updated independently. The cellular automata (CAs) rules are classified as reversible and irreversible rules. The irreversible rules cannot configure reversible ACAs. The reversible rules may configure reversible ACAs depending upon the update of ACA cells. Finally, an algorithm is developed that outputs a sequence of ACA cells for a given CA rule to be updated to generate a cycle for a reversible ACA.
