Asynchronous cellular automata that hide some of the configurations during evolution
Keyword(s):
In the light of recent developments in the theory of reversibility for asynchronous cellular automata, we attempt to explore the dynamics of recurrent rules under fully asynchronous updating scheme. Depending on the reachability of the configurations for a communication class during the evolution of the system, we classify the recurrent rules into two classes — partially exposed recurrent system and fully exposed recurrent system.
SIMPLE AND FLEXIBLE SELF-REPRODUCING STRUCTURES IN ASYNCHRONOUS CELLULAR AUTOMATA AND THEIR DYNAMICS
2013 ◽
Vol 24
(03)
◽
pp. 1350015
◽
Keyword(s):
2007 ◽
pp. 401-409
◽
2004 ◽
Vol 6
(2)
◽
pp. 181-201
◽