Reversibility of  – asynchronous Cellular Autotmata: A simulation-based study

Abstract

Cellular automata (CA) is a computing model. Change of CA cells are governed by the CA rules 0 – 255. When cells of CA are subject to change synchronously then that CA is referred as synchronous CA. But when all the cells do not participate in the process of change synchronously is called Asynchronous CA (ACA). The most complex type of ACA is  – asynchronous Cellular Automata where all the cells changes according to a probability. Reversibility is one important issue where we check if it's possible for CA with any initial state to comeback to this initial state after some time steps. We have attempted to study the reversibility of  – asynchronous cellular automata in this work which is so far not reported in the literature.