Results 201 to 210 of about 1,495 (223)

Computational Aspects of Asynchronous Cellular Automata

open access: yesLecture Notes in Computer Science, 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   +3 more
exaly   +7 more sources

Computational aspects of elementary cellular automata

open access: yes, 2012
We investigate the computational capacities of finite and infinite elementary cellular automata in light of their topological dynamics properties.
Schüle, M, Stoop, Ruedi
openaire   +3 more sources
Some of the next articles are maybe not open access.

Related searches:

Computational Aspects of Cellular Automata on Countable Sofic Shifts

Lecture Notes in Computer Science, 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ä
exaly   +5 more sources

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

Discrete event cellular automata: A new approach to cellular automata for computational material science

Computational Materials Science, 2023
James Nutaro, Pratishtha Shukla
exaly  

How much past to see the future: a computational study in calibrating urban cellular automata

International Journal of Geographical Information Science, 2015
Ivan Blečić   +2 more
exaly  

Home - About - Disclaimer - Privacy