Some Formal Properties of Asynchronous Cellular Automata

2010 ◽  
pp. 419-428 ◽  
Author(s):  
Luca Manzoni
Keyword(s):  
Cellular Automata ◽  
Asynchronous Cellular Automata ◽  
Formal Properties

Reversible Computation in Asynchronous Cellular Automata

2002 ◽  
pp. 220-229 ◽  
Author(s):  
Jia Lee ◽  
Ferdinand Peper ◽  
Susumu Adachi ◽  
Kenichi Morita ◽  
Shinro Mashiko
Keyword(s):  
Cellular Automata ◽  
Reversible Computation ◽  
Asynchronous Cellular Automata

Asynchronous cellular automata that hide some of the configurations during evolution

2021 ◽  
pp. 2150054
Author(s):  
Souvik Roy ◽  
Sukanta Das
Keyword(s):  
Cellular Automata ◽  
Asynchronous Cellular Automata ◽  
Recent Developments ◽  
Recurrent System ◽  
Asynchronous Updating

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.

Sign in / Sign up

Export Citation Format

Share Document