A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Reversibility in Asynchronous Cellular Automata
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 todoi:10.25088/complexsystems.21.1.71 fatcat:b5j7gxzjrjbv3acuv2vkydgeqy