Results 191 to 200 of about 17,878 (214)
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.
Ilkka Törmä, Ville Salo
+6 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 +3 more
openaire +6 more sources
Computational aspects of elementary cellular automata
, 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:
Related searches:
Blueprint for cancer research: Critical gaps and opportunities
Ca-A Cancer Journal for Clinicians, 2021J Bonilla, C D Booth, D Boscherini
exaly
Enhancing global access to cancer medicines
Ca-A Cancer Journal for Clinicians, 2020Javier Cortés +2 more
exaly
Genetic testing in prostate cancer management: Considerations informing primary care
Ca-A Cancer Journal for Clinicians, 2022Veda N Giri +2 more
exaly
Time to add screening for financial hardship as a quality measure?
Ca-A Cancer Journal for Clinicians, 2021Cathy J Bradley +2 more
exaly