Results 221 to 230 of about 5,964 (241)

Reversible cellular automaton able to simulate any other reversible one using partitioning automata

1995
Partitioning automata (PA) are defined. They are equivalent to cellular automata (CA). Reversible sub-classes are also equivalent. A simple, reversible and universal partitioning automaton is described. Finally, it is shown that there are reversible PA and CA that are able to simulate any reversible PA or CA on any configuration.
openaire   +1 more source

Parallel Image Encryption Algorithm Using Partitioned Cellular Automata on Graphic Processor Unit

2023 IEEE International Conference on Omni-layer Intelligent Systems (COINS), 2023
Mahmood Fazlali, Amirhossein Alihoseini, Ebrahim Zarei, Myasar Tabani, Seyedali Pourmoafi   +4 more
openaire   +1 more source

A Cellular Automata Model of Oil-Water Partitioning

Journal of Chemical Information and Computer Sciences, 1995
Chao-Kung Cheng, Lemont B. Kier
openaire   +1 more source

Partitioning of Cellular Automata Rule Spaces

Complex Systems, 2015
openaire   +1 more source

Partitioned Geo-Cellular Automata Modelling Embedded Spatial Cluster Algorithm

Geo-information Science, 2010
Xinli KE, Xiangzheng DENG
openaire   +1 more source

Time-reversal symmetries in two-dimensional reversible partitioned cellular automata and their applications

International Journal of Parallel, Emergent and Distributed Systems, 2022
openaire   +1 more source

Reversible Elementary Triangular Partitioned Cellular Automata and Their Complex Behavior

2022
openaire   +1 more source

A brief history of cellular automata

ACM Computing Surveys, 2000
Palash Sarkar
exaly  

Cellular Phones and Risk of Brain Tumors

Ca-A Cancer Journal for Clinicians, 2001
Howard Frumkin, Anne Jacobson
exaly  

Cellular automata models of road traffic

Physics Reports, 2005
Sven Maerivoet
exaly