Number Conservation Property of Binary Cellular Automata Under α-Asynchronous Update.

This paper studies the number conservation behavior of binary asynchronous cellular automata (ACAs). We consider here a-asynchronous update scheme. It is, however, shown in the beginning of the study that no binary CA (except identity rule), in general, can be claimed as number conserving under asynchronous update. We then introduce the idea of probabilistic number conservation of ACAs. We find a set of binary ACAs which are probabilistic number conserving ACAs. We observe that these ACAs are not dependent on any specific value of a. Further, some additional ACAs have been found which have a tendency to conserve the expected number of 1s of the seeds having density 0.5. [ABSTRACT FROM AUTHOR]