Results 31 to 40 of about 1,554,379 (330)
Some Approaches to Modeling the Spatial Diffusion of Innovations [PDF]
The study considers the problems of modeling diffusion of innovations in economic systems. The authors show the capabilities and limitations of the use of deterministic and probabilistic cellular automata in modeling the diffusion of innovations.
Yuriy Davidovich Schmidt+1 more
doaj +1 more source
Phase Space Invertible Asynchronous Cellular Automata [PDF]
While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata.
Simon Wacker, Thomas Worsch
doaj +1 more source
A novel ergodic cellular automaton model of gene-protein network is presented. It is shown that the presented model can predict occurrences of typical nonlinear phenomena of a conventional ordinary differential equation gene-protein network model.
Shogo Shirafuji, Hiroyuki Torikai
doaj +1 more source
Cellular automaton model of damage [PDF]
11 pages, 11 figures (2 in color). Various corrections as recommended by referees. This is the final version for publication in Phys.
W. Klein, John B. Rundle, C. A. Serino
openaire +3 more sources
On a periodic soliton cellular automaton [PDF]
We propose a box and ball system with a periodic boundary condition (pBBS). The time evolution rule of the pBBS is represented as a Boolean recurrence formula, an inverse ultradiscretization of which is shown to be equivalent with the algorithm of the calculus for the 2Nth root. The relations to the pBBS of the combinatorial R matrix of ${U'}_q(A_N^{(1)
Fumitaka Yura, Tetsuji Tokihiro
openaire +4 more sources
Strictly Temporally Periodic Points in Cellular Automata [PDF]
We study the set of strictly periodic points in surjective cellular automata, i.e., the set of those configurations which are temporally periodic for a given automaton but they not spatially periodic.
Alberto Dennunzio+2 more
doaj +1 more source
Post-surjectivity and balancedness of cellular automata over groups [PDF]
We discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every pre-image of one is asymptotic to a pre-image of the other.
Silvio Capobianco+2 more
doaj +1 more source
A cellular automaton for blocking queen games [PDF]
We show that the winning positions of a certain type of two-player game form interesting patterns which often defy analysis, yet can be computed by a cellular automaton. The game, known as {\em Blocking Wythoff Nim}, consists of moving a queen as in chess, but always towards (0,0), and it may not be moved to any of $k-1$ temporarily "blocked" positions
Cook Matthew+2 more
openaire +6 more sources
Cellular Automata are Generic [PDF]
Any algorithm (in the sense of Gurevich's abstract-state-machine axiomatization of classical algorithms) operating over any arbitrary unordered domain can be simulated by a dynamic cellular automaton, that is, by a pattern-directed cellular automaton ...
Nachum Dershowitz, Evgenia Falkovich
doaj +1 more source
BIO-LGCA: A cellular automaton modelling class for analysing collective cell migration
Collective dynamics in multicellular systems such as biological organs and tissues plays a key role in biological development, regeneration, and pathological conditions.
A. Deutsch+3 more
semanticscholar +1 more source