Results 181 to 190 of about 18,855 (210)

Information dynamics of cellular automata : CA computation and information theory (New Aspects of Theoretical Computer Science)

Information dynamics of cellular automata : CA computation and information theory (New Aspects of Theoretical Computer Science)
openaire  

Development necessitates evolutionarily conserved factors. [PDF]

Sci Rep
Chow PCK, Bentley PJ.
europepmc   +1 more source

Review on Cellular Automata for Microstructure Simulation of Metallic Materials. [PDF]

Materials (Basel)
Zhi Y, Jiang Y, Ke D, Hu X, Liu X.
europepmc   +1 more source

Optimal Computational Modeling and Simulation of QCA Reversible Gates for Information Reliability in Nano-Quantum Circuits. [PDF]

Nanomaterials (Basel)
Jeon JC.
europepmc   +1 more source

Spatiotemporal influence analysis model for cultural landscapes based on a virtual geographic environment. [PDF]

Sci Rep
She X, Pan X, Zhao J.
europepmc   +1 more source

Methodological Insights into Implementing cellular automata models for simulating seagrass dynamics: Responses to global change effects. [PDF]

MethodsX
Beca-Carretero P, Meister M, Teichberg M, Moreira-Saporiti A, Schneekloth F, Reuter H.   +5 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Computation theoretic aspects of cellular automata

Physica D: Nonlinear Phenomena, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Culik, K. II, Hurd, L. P., Yu, S.
openaire   +3 more sources

Computational Aspects of Cellular Automata on Countable Sofic Shifts

2012
We investigate the computational properties of cellular automata on countable (equivalently, zero entropy) sofic shifts with an emphasis on nilpotency, periodicity, and asymptotic behavior. As a tool for proving decidability results, we prove the Starfleet Lemma, which is of independent interest.
Ville Salo, Ilkka Törmä, ERROR, Kustannuspaikka   +2 more
openaire   +3 more sources

Computational Aspects of Asynchronous Cellular Automata

2011
Cellular Automata (CA) are a computational model widely used in many scientific fields. A CA consists of identical finite automata arranged over a regular lattice (i.e. every configuration of a CA is an element of A ℤ where A is a finite set of local states).
Chandesris, J, DENNUNZIO, ALBERTO, Formenti, E, MANZONI, LUCA   +3 more
openaire   +4 more sources