منابع مشابه
Cyclic Cellular Automata in 3D
Cyclic cellular automata in two dimensions have long been intriguing because they self organize into spirals and that behavior can be analyzed. The form for the patterns that develop is highly dependent upon the form of the neighborhood. We extend this work to three dimensional cyclic cellular automata and observe self organization dependent upon the neighborhood type. This includes neighborhoo...
متن کاملDynamic of cyclic automata over Z2
Let K be the two-dimensional grid. Let q be an integer greater than 1 and let Q={0; : : : ; q−1}. Let s :Q → Q be de0ned by s( ) = ( + 1)mod q, ∀ ∈ Q. In this work we study the following dynamic F on QZ 2 . For x ∈ QZ2 we de0ne Fv(x)= s(xv) if the state s(xv) appears in one of the four neighbors of v in K and Fv(x) = xv otherwise. For x ∈ QZ2 , such that {v∈Z2 : xv = 0} is 0nite we prove that t...
متن کاملMedley of spirals from cyclic cellular automata
Cyclic cellular automata on the integer planar lattice are known to typically evolve through distinct phases ending with minimal periodic terminal states that usually appear as intertwined spirals. Here we explore the diversity of spirals that arise from nonstandard neighborhoods on the integer lattice and from looking at the automata on quasi-crystalline arrangements of cells. We see that phas...
متن کاملQuantifying Self-Organization in Cyclic Cellular Automata
Cyclic cellular automata (CCA) are models of excitable media. Started from random initial conditions, they produce several different kinds of spatial structure, depending on their control parameters. We introduce new tools from information theory that let us calculate the dynamical information content of spatial random processes. This complexity measure allows us to quantitatively determine the...
متن کاملDynamic Behavior of Cyclic Automata Networks
We study the principal dynamical aspects of the cyclic automata on finite graphs. We give bounds in the transient time and periodicity depending essentially on the graph structure. It is shown that there exist non-polynomial periods e 61(m) , where /V / denotes the number of sites in the graph. To obtain these results we introduce some mathematical tools as continuity, firing paths, jumps and e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1987
ISSN: 0304-3975
DOI: 10.1016/0304-3975(87)90071-5