相关论文: Cellular Automation of Galactic Habitable Zone
We created two dimensional hexagonal cellular automata to obtain complexity. Considering the game of life rules, Wolfram's works about life-like structures and John von Neumann's self-replication, self-maintenance, self-reproduction…
A simple mechanism for the emergence of complexity in cellular automata out of predictable dynamics is described. This leads to unfold the concept of conditional predictability for systems whose trajectory can only be piecewise known. The…
Probabilistic cellular automata describe the dynamics of classical spin models, which, for sufficiently small temperature $T$, can serve as classical memory capable of storing information even in the presence of nonzero external magnetic…
Each cell of a two-dimensional lattice is painted one of k colors, arranged in a "color wheel." The colors advance (0 to k-1 mod k) either automatically or by contact with at least a threshold number of successor colors in a prescribed…
It is well-known that the spacetime diagrams of some cellular automata have a fractal structure: for instance Pascal's triangle modulo 2 generates a Sierpinski triangle. Explaining the fractal structure of the spacetime diagrams of cellular…
We present a family of one-dimensional cellular automata modeling the diffusion of an innovation in a population. Starting from simple deterministic rules, we construct models parameterized by the interaction range and exhibiting a…
We propose the concept of a "Galactic Habitable Zone" (GHZ). Analogous to the Circumstellar Habitable Zone (CHZ), the GHZ is that region in the Milky Way where an Earth-like planet can retain liquid water on its surface and provide a…
Cellular automata are discrete and computational models thatcan be shown as general models of complexity. They are used in varied applications to derive the generalized behavior of the presented model. In this paper we have took one such…
In this article, we have proposed an epidemic model by using probability cellular automata theory. The essential mathematical features are analyzed with the help of stability theory. We have given an alternative modelling approach for the…
In this work a three-states cellular automaton proposed to describe part of a biological immune system is revisited. We obtain the dynamic critical exponent $z$ of the model by means of a recent technique that mixes different initial…
Probabilistic timed automata are classical timed automata extended with discrete probability distributions over edges. We introduce clock-dependent probabilistic timed automata, a variant of probabilistic timed automata in which transition…
We define the class of rapidly left expansive cellular automata, which contains fractional multiplication automata, Wolfram's Rule 30, and many others. The definition has been shaped by a proposition of Jen on aperiodicity of columns in…
To celebrate Hans Frauenfelder's achievements, we examine energy(-like) "landscapes" for complex living systems. Energy landscapes summarize all possible dynamics of some physical systems. Energy(-like) landscapes can explain some…
Cellular automata (CA) provide a minimal formalism for investigating how simple local interactions generate rich spatiotemporal behavior in domains as diverse as traffic flow, ecology, tissue morphogenesis and crystal growth. However,…
A one-dimensional cellular automaton with a probabilistic evolution rule can generate stochastic surface growth in $(1 + 1)$ dimensions. Two such discrete models of surface growth are constructed from a probabilistic cellular automaton…
In this paper we consider cellular automata $(\mathfrak{G},\Phi)$ with algebraic local rules and such that $\mathfrak{G}$ is a topological Markov chain which has a structure compatible to this local rule. We characterize such cellular…
Cellular automata can simulate many complex physical phenomena using the power of simple rules. The presented methodological platform expresses the concept of programmable matter in which Newtons laws of motion are one of examples. Energy…
We demonstrate that a local mapping f in a space of bisequences over {0,1} which conserves the number of nonzero sites can be viewed as a deterministic particle system evolving according to a local mapping in a space of increasing…
A transition from asymmetric to symmetric patterns in time-dependent extended systems is described. It is found that one dimensional cellular automata, started from fully random initial conditions, can be forced to evolve into complex…
In this paper, under certain conditions we consider two-dimensional cellular automata with the Moore neighborhood. Namely, the characterization of 2D linear cellular automata defined by the Moore neighborhood with some mixed boundary…