Computing on a Simple Asynchronous Cellular Automaton

An asynchronous cellular automaton (ACA) is a cellular automaton which allows cells to undergo state transitions independently at random timings. This paper gives an efficient scheme to compute on a special ACA model that takes a substantially simple transition function. This ACA has much less complexity as compared to other models with respect to the number of transition rules.